Basics

• Stack: Array Implementation
• Stack: Linked List Implementation
• Queue: Array Implementation
• Queue: Linked List Implementation
• Binary and Linear Search

Stack: Array Implementation

Push

Pop

Stack using Linked List

Push

Pop

Queue using Array

Enqueue

Dequeue

Queue using Linked List

Enqueue

Dequeue

Binary and Linear Search

Linear Search

Binary Search

Trees

• Binary Search Trees
• AVL Trees
• Red-Black Trees
• Splay Trees
• Trie (Prefix Tree)
• Radix Tree (Compact Trie)
• Ternary Search Tree (Trie with BST)
• B Trees
• B+ Trees

Binary Search Trees

Insert

Delete

Find

Print

AVL Trees

Insert

Delete

Find

Print

Red-Black Trees

Insert

Delete

Find

Print

Splay Trees

Insert

Delete

Find

Print

Trie (Prefix Tree)

Insert

Delete

Find

Print

Radix Tree (Compact Trie)

Insert

Delete

Find

Print

Ternary Search Tree

Insert

Delete

Find

Print

B Trees

Insert

Delete

Find

Print

B+ Trees

Insert

Delete

Find

Print

Hashing

• Open Hash Tables (Closed Addressing)
• Closed Hash Tables (Open Addressing)
• Closed Hash Tables, using buckets

Open Hash Tables (Closed Addressing)

Insert

Delete

Find

Closed Hash Tables (Open Addressing)

Insert

Delete

Find

Closed Hash Tables, using buckets

Insert

Delete

Find

Heaps

• Heaps
• Binomial Queues
• Fibonacci Heaps
• Leftist Heaps
• Skew Heaps

Heaps

Insert

Remove smallest

Build heap

Binomial Queues

Insert

Remove smallest

Fibonacci Heaps

Insert

Remove smallest

Leftist Heaps

Insert

Remove smallest

Skew Heaps

Insert

Remove smallest

Graph Algorithms

• Breadth-First Search
• Depth-First Search
• Connected Components
• Dijkstra's Shortest Path
• Prim's Minimum Cost Spanning Tree
• Topological Sort (using Indegree array)
• Topological Sort (using DFS)
• Floyd-Warshall (all pairs shortest paths)
• Kruskal Minimum Cost Spanning Tree

Breadth-First Search

BFS from 1

Depth-First Search

DFS from 1

Connected Components

Connected components

Dijkstra's Shortest Path

Dijkstra from 1

Prim's Minimum Cost Spanning Tree

Prim from 1

Topological Sort (Indegree)

Topological Sort

Topological Sort (DFS)

Topological Sort

Floyd-Warshall All-Pairs Shortest Path

Floyd-Warshall

Kruskal Minimum Cost Spanning Tree

Kruskal

Recursion

• Factorial
• Reversing a String
• N-Queens Problem

Factorial

Factorial(3)

Reversing a String

Reverse("abc")

N-Queens Problem

Qeens(4)