Data Structures in C++ (To be updated)

Graphs

1. Breadth First Search
2. Dijkstra’s shortest path algorithm
3. Check Reachibility in a Graph

Singly Linked List :

Functions :

1. Display Linked List
2. Append Node
3. Insert at Start
4. Insert at Position
5. Delete at End
6. Delete at Start
7. Delete at Position
8. Reverse
9. Remove all Duplicate Elements
10. Search by Value
11. Search by Position

Heap Sort

Types :

1. Inplace Heap Sort
2. Not Inplace Heap Sort

Infix to Postfix

Merge Sort

Priority Queue

Quick Sort

Tree

Binary Tree :

Functions :

1. Create a Binary Tree
2. Show Preorder
3. Show Inorder
4. Show Postorder
5. Calculate Maximum Height/Depth of the Tree
6. Display Number of Leaf nodes
7. Display Number of Internal nodes
8. Display Number of all nodes
9. Display Number of full nodes

Binary Search Tree :

Functions :

1. Create a BST from an array
2. Search in BST
3. Inorder

AVL Tree (Self Balancing Binary Search Tree) :

Functions :

1. Create an AVL Tree from an array
2. Search in AVL Tree
3. Inorder