📄️ Depth First Search
This technique uses recursion or iterative approach using stack to keep track of all the previous (parent) nodes while traversing trees in a depth-first search manner.
📄️ Breadth First Search
This technique uses recursion or iterative approach using queue to traverse of a tree in a level-by-level order. A queue keeps track of all the nodes of a level before jumping onto the next level.
📄️ Heaps
This technique uses Min-Heap (or Max-Heap) whenever you need quick access to the smallest (or largest) item in input data.
📄️ Trie (Prefix Tree)
The technique is a tree data structure used to efficiently store and retrieve keys in a dataset of strings.