Competitive Programming Roadmap
Trees
Learning Path
Follow these concepts in order to master this topic.
1
Introduction to Trees2
Tree Terminology3
Rooted Trees4
Binary Trees5
Binary Search Trees6
N-ary Trees7
Tree Representation8
DFS on Trees9
BFS on Trees10
Preorder Traversal11
Inorder Traversal12
Postorder Traversal13
Tree Height & Depth14
Tree Diameter15
Tree Centers16
Lowest Common Ancestor (LCA)17
Binary Lifting18
Euler Tour Technique19
Subtree Queries20
Tree Dynamic Programming21
Rerooting DP22
Fenwick Tree on Euler Tour23
Segment Tree on Trees24
Heavy-Light Decomposition25
Virtual Trees26
Contest Tree PatternsDocumentation
Official documentation and references.
Video Courses
Recommended free video courses.
Practice Websites
Practice what you've learned.
Projects
Apply what you've learned by building real projects.
Build a Complete Tree Algorithms Library
AdvancedImplement LCA, Tree DP, Euler Tour & HLD from Scratch
AdvancedSolve 100 Tree Problems
Advanced