1.1 Infix To Postfix
1.2 Infix to Prefix
1.3 Postfix Evaluation
2.1 Chaining
2.2 Linear Probing
2.3 Sorting
2.3.1 Heap Sort
2.3.2 Merge Sort
2.3.3 Bubble Sort
2.3.4 Quick Sort
2.3.5 Insertion Sort
2.3.6 Selectionn Sort
3.1 Circular Queue
3.2 Priority Queue
3.3 Queue
3.4 Stack
4.1 BST
4.2 Binary Tree
4.3 DFS and BFS of GRAPH