Trees are non-linear hierarchical data structures composed of connected parent and child nodes. Master Depth-First Search (Pre-order, In-order, Post-order) and Level-Order Breadth-First Search (BFS) traversals in C++.
Depth-First Search (DFS): Explores as deep as possible down each branch before backtracking.
Breadth-First Search (BFS): Level-order traversal using queue buffer for shortest path depth.
Lowest Common Ancestor (LCA): Finding split ancestor node in O(N) single traversal.
Tree Diameter: Finding max distance between any two leaf nodes via bottom-up recursion.