Tree Data Structures and Traversal Questions

Focused study of tree structures and traversal techniques including binary trees, binary search trees, n-ary trees, and specialized trees used in algorithms. Candidates should be fluent with traversal orders such as in order, pre order, post order, and level order, both recursive and iterative implementations, and tree operations including insertion, deletion, and search. Additional skills include finding lowest common ancestors, validating binary search tree properties, balancing strategies and tree rotations used in self balancing trees, understanding use cases such as expression trees and scene graphs, and solving common problems that require tree manipulation or combined techniques with other structures.