Data-Structures

A repository of the various common data structures I have coded in C and C++:

Linked Lists

• Linked List
• Doubly Linked List

Stacks

• Stack using Array
• Stack Using Linked List

Queues

• Queue
• Circular Queue Using Array
• Queue using Linked List

Trees

• Binary Tree
• Binary Search Tree
• AVL Tree
• Red Black Tree
• 2-3 Tree
• B Tree

Heap

• Max Heap using Array

Hash Maps

• Simple Uniform Hashing
• Double Hashing
• Universal Hashing
• Perfect Hashing

Text Pattern Matching (Tries)

• Rabin Karp
• KMP
• Boyre Moore
• Standard Trie for Suffix Matching
• Compressed Trie for Suffix Matching

Graphs

• Simple Graph
• Breadth First Search (BFS) to find the shortest path
• Bellman Ford Algorithm
• Dijkstra's Algorithm (Using Adjacency Matrix)
• Dijkstra's Algorithm (Using Adjacency List)
• Bidirectional Dijkstra's Algorithm
• Johnson's Algorithm
• Edmond Karp Algorithm to find maximum flow in a flow network
• Relabel to Front Algorithm to find maximum flow in a flow network