CMPE 226 • Tüm Sınavlar • Data Structures

Introduction

Definition and Decleration

Assignment and Dereference

Be Careful!

Pointer of Pointers - new Keyword

Pointers with Arrays

sizeof() - malloc() - free()

delete Keyword

Pointers as Function Parameters

Pointers of Functions

Example 1

Example 2

Example 3

Static Array vs Dynamic Array

2D Static Arrays

2D Dynamic Arrays

Efficiency of Pointers

Example 1

Example 2

Motivation

Big-O Notation

Analyzing Complexity

Definition of Recursion

An Example: Factorials

Another Example: Fibonacci Numbers

Another Example: Binary Search Operation

Introduction

Singular LinkedList

Doubly LinkedList

Circular LinkedList

Some Background Information

What is a linkedlist?

Reminder: Structs

Constructing Linkedlists

Head and Tail Pointers

Printing a Linkedlist

Adding a Node to the End

Adding a Node in between Two Nodes (Add to a Sorted List)

Finding a Node in the List

Deleting a Node

Deleting the List

Example 1 (Parts a-c)

Example 1 (Parts d-e)

Example 2 (Part 1)

Example 2 (Part 2)

What is a Circular Linkedlist?

Constructing the List

Adding a Node to the Beginning/End

Adding a Node in between Two Nodes (Add to a Sorted List)

Counting Number of Elements

Finding a Node in the List

Deleting a Node

Example 1 (Parts a-c)

Example 1 (Parts d-e)

Example 2 (Part 1)

Example 2 (Part 2)

Constructing the List

Adding a Node to the Beginning

Adding a Node In Between two Nodes (Add to a Sorted List)

Adding a Node to End of the List

Deleting a Node from the Beginning

Deleting a Node in between Two Nodes (Deleting from a Sorted List)

Deleting a Node from the End

Finding a Node in the List

Example 1 (Parts a-c)

Example 1 (Parts d-e)

Example 2 (Part 1)

Example 2 (Part 2)

Recursion

Recursion

Recursion

Recursion

Recursion

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked List

Linked Lists

Recursion

Doubly Linked Lists

Introduction

Array Implementation

LinkedList Implementation

Static Int Stack Implementation

Using StaticIntStack

Dynamic Int Stack

Dynamic Int Stack Implementation

Using DynIntStack

What is a Queue?

Queue Operations

Problem with dequeue

Static Int Queue Implementation

Using StaticIntQueue

Dynamic Int Queue

Dynamic Int Queue Implementation

Using DynIntQueue

Stack vs Queue

Linear v Binary

Codes

Neden hashing?

Handling Collusions

Example 1

Hashtable.h (Seperate Chaining version)

Seperate Chaining Implementation

Example 2

Hashtable.h (Open Addressing version)

Open Addressing Implementation

Example 3

Stack

Stack

Stack

Stack

Stack

Stack

Queue

Stack/Queue

Stack/Queue

Stack/Queue

Stack/Queue

Stack/Queue

Stack/Queue

Linked List/Stack/Queue

Linked List/Stack/Queue

Linked List/Stack/Queue

Linked List/Stack/Queue

Searching

Searching

Hashing

Hashing

Hashing

Hashing

Hashing

Sorting

Stack

Queue

Hashing 1

Hashing 2

Why is this important?

Selection Sort

Example

Selection Sort - Code

Insertion Sort

Example 1

Insertion Sort - Code

Shell Sort

Example 2

Shell Sort - Code

Heap Sort

Example 3

Heap Sort - Code

Merge Sort

Example 4

Merge Sort - Code

Quick Sort

Example 5

Quick Sort - Code

Tree as a Data Structure

Terminology

How do we implement Trees?

Binary Trees / Binary Search Trees

Example 1

BST.h

Implementation - Constructors/Copying

Implementation - Destructors

Implementation - Find

Implementation - FindMin/FindMax

Implementation - Insert/Remove

Implementation - Printing

Example 2

Example 3

Example 4

Example 5

Example 6

Example 7

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Sorting

Trees

Trees

Trees

Trees

Trees

Trees

Linked List

Data Structures

Trees

Trees 2

Trees 3