COMP 2233 • Final • Data Structures

What is a Stack?

Stack Operations

Stacks using Arrays

Using StaticIntStack

Stacks using Linked Lists

Dynamic Int Stack Implementation

Using DynIntStack

What is a Queue?

Queue Operations

Problem with dequeue

Queues using Arrays

Using StaticIntQueue

Queues using Linked Lists

Dynamic Int Queue Implementation

Using DynIntQueue

Stack vs Queue

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

Introduction and Graph Types

Path, Cycle, Degree

Graph Representations

Example

Dijkstra's Algorithm

Example 1

Example 2

Breadth-First Search (BFS)

Example 3

Depth-First Search (DFS)

Example 4

Minimum Spanning Tree Problem

Prim's Algorithm

Example 1

Kruskal's Algorithm

Example 2

Patron çıldırdı, O(1) istiyor!

Handling Collusions

Example 1

Hashtable.h (Seperate Chaining version)

Seperate Chaining Implementation

Example 2

Hashtable.h (Open Addressing version)

Open Addressing Implementation

Example 3

Linear v Binary

Codes

Why is this important?

Selection Sort

Example

Selection Sort - Code

Quick Sort

Example

Quick Sort - Code

Stacks and Queues

Stacks and Queues

Trees & BST

Trees & BST

Graphs

Graphs

Graphs

Graphs

Hashtables

Sorting Algorithms

Stacks and Queues

Stacks and Queues

Trees & BST

Graphs

Graphs

Graphs

Graphs

Hashtables

Search Algorithms

Sort Algorithms

Stacks and Queues

Stacks and Queues

Trees & BST

Trees & BST

Graphs

Graphs

Graphs

Hashtables

Sort Algorithms

Sort Algorithms

Stacks and Queues

Stacks and Queues

Trees & BST

Graphs

Graphs

Graphs

Graphs

Hashtables

Sort Algorithms

Sort Algorithms