L-3.11: Build Heap in O(n) time complexity | Heapify Method | Full Derivation with example

6.10 Topological Sorting (with Examples) | How to find all topological orderings of a Graph

Segregate 0's, 1's and 2's together in an array[O(n)](Dutch National Flag Problem)

3.9 Evaluation of Prefix and Postfix expressions using stack | Data structures

7.11 Shell Sort algorithm | sorting algorithms | Full explanation with code | data structures