Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Binary Trees
Problemset
Discussion
AI Helper
Arrays & Prefix Sums
0/50
Stacks & Monotonic Stacks
0/40
Queues & Deques
0/38
Hash Tables
0/40
Heaps & Priority Queues
0/43
Linked Lists
0/36
Binary Trees
0/35
1
Intro
2
Binary Tree Node
3
Tree Properties
4
Three Traversal Orders
5
Recursive Traversal
6
Problem - Binary Tree Inorder
7
Iterative Inorder
8
Inorder Traversal Solution
9
Level Order Traversal
10
Recursive Tree Thinking
11
Problem - Maximum Depth
12
Max Depth Solution
13
Problem - Same Tree
14
Same Tree Solution
15
Problem - Invert Binary Tree
16
Invert Tree Solution
17
Problem - Symmetric Tree
18
Symmetric Tree Solution
19
Path Sum Pattern
20
Problem - Path Sum
21
Path Sum Solution
22
Building Trees from Traversals
23
Problem - Construct from Traversals
24
Construction Algorithm
25
Construct Tree Solution
26
Lowest Common Ancestor
27
Serialization Pattern
28
Problem - Diameter of Binary Tree
29
Diameter Solution
30
Problem - Flatten to Linked List
31
Flatten Solution
32
Morris Traversal
33
Binary Tree from Array
34
Quiz: Binary Trees
35
Section Recap
Binary Search Trees
0/35
Tries
0/35
Union-Find
0/35
Segment Trees
0/35
Fenwick Trees
0/35
Sparse Tables
0/35
Sqrt Decomposition
0/42
Advanced Trees
0/42
Interval Trees
0/40
Wavelet Trees
0/37
Link-Cut Trees
0/39
Persistent Data Structures
0/37
7.1
Intro
2 minutes
100%
Tasks
Read Unit