- Breadth First Search
- Dijkstra’s shortest path algorithm
- Check Reachibility in a Graph
- Display Linked List
- Append Node
- Insert at Start
- Insert at Position
- Delete at End
- Delete at Start
- Delete at Position
- Reverse
- Remove all Duplicate Elements
- Search by Value
- Search by Position
- Inplace Heap Sort
- Not Inplace Heap Sort
- Create a Binary Tree
- Show Preorder
- Show Inorder
- Show Postorder
- Calculate Maximum Height/Depth of the Tree
- Display Number of Leaf nodes
- Display Number of Internal nodes
- Display Number of all nodes
- Display Number of full nodes
- Create a BST from an array
- Search in BST
- Inorder
- Create an AVL Tree from an array
- Search in AVL Tree
- Inorder