Chapter 5.3: Trees & Special Graphs

⚡ This chapter's content has been merged into Chapter 5.5 "Binary Trees & Tree Algorithms"

All tree-related content (traversals, LCA, tree diameter, Euler tour) is now consolidated in:

🔗 Content Navigation

Tree Traversals (Pre-order / In-order / Post-order / Level-order)

→ Chapter 5.5 §3.11.3

Lowest Common Ancestor (LCA)

• Naive approach (O(N)) → Chapter 5.5 §3.11.5
• Binary Lifting (O(log N)) → Chapter 5.5 §5.5.1

Tree Diameter (Two BFS)

→ Chapter 5.5 §5.5 Practice Problem 5.5.2

Euler Tour (DFS Timestamps)

→ Chapter 5.5 §5.5.2

Union-Find (DSU / Disjoint Set Union)

→ Chapter 5.6 "Union-Find" (path compression, Kruskal MST, weighted DSU, bipartite DSU)

💡 Chapter 5.5 is the complete tree algorithms chapter, covering everything from BST basics to LCA binary lifting and Euler tour, with 10 practice problems (with full solutions).