Posts tagged with

Trees

Know the properties of a BST. Understand the time complexity for search, insertion, and deletion. Be able to validate if a given tree is a BST.

Be able to implement and explain the differences between In-order, Pre-order, and Post-order (DFS variations) and Level-order (BFS) traversals, both recursively and iteratively.