- Array -- Heap Sort -- QuickSort -- Identifying Kth Highest/Lowest from an array -- Linear Search -- Binary Search -- Merge two sorted arrays
- Queue implementation using -- Circular array -- Circular Linked List -- Two stacks
- Tree Traversal -- InOrder -- PreOrder -- PostOrder -- ReverseInOrder
- Trie implementation using Nested Dictionary
- Graph implementation using Dictionary of Dictionary -- Depth First Traversal -- Breadth First Traversal