Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Binary Search 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
Binary Search Trees
0/35
1
Intro
2
BST Property
3
Inorder Gives Sorted Order
4
BST Search
5
BST Insertion
6
BST Deletion
7
Problem - Validate BST
8
Validate BST: Range Approach
9
Validate BST Solution
10
Problem - Search in BST
11
Search in BST Solution
12
Problem - Insert into BST
13
Insert into BST Solution
14
Problem - Delete Node in BST
15
Delete Node: Finding Successor
16
Delete Node in BST Solution
17
Problem - Kth Smallest Element
18
Kth Smallest Solution
19
Problem - LCA of BST
20
LCA of BST Solution
21
Why Balance Matters
22
AVL Tree Concept
23
When to Use BSTs
24
Problem - Sorted Array to BST
25
Sorted Array to BST Solution
26
Problem - BST Iterator
27
BST Iterator Solution
28
Problem - Recover BST
29
Recover BST: Finding Violations
30
Recover BST Solution
31
Floor and Ceiling
32
BST from Preorder
33
Successor and Predecessor
34
Quiz: Binary Search Trees
35
Section Recap
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
8.1
Intro
2 minutes
100%
Tasks
Read Unit