Skip to content

Tracks

AI-assisted engineering Working with AI Agents System design Core systems Data and AI systems Coding Coding problems Code review On-call SQL

Practice

Paths Concept guides

FreeAd-supported

The plan adds AI feedback and removes ads.

Concept guides/Graphs and trees/Binary search trees & balancing

CodingGraphs and trees

Binary search trees & balancing

Medium3 min read

Questions it teaches

Range sum in BSTEasy15 min BST lookup pathEasy17 min Kth smallest element in BSTMedium20 min Count inversions in tree traversalMedium20 min Closest value in BSTMedium20 min Height balanced binary treeMedium20 min Minimum BST heightMedium20 min Balanced BST from sorted arrayMedium25 min

Related

Graphs and trees Searching and sorting Designing data structures Dynamic programming

Builds on: Searching and sorting

Sorting algorithms3 min Two pointers3 min

Builds on: Designing data structures

Queues, deques & ring buffers3 min Database deduplication3 min

Leads to: Dynamic programming

Dynamic programming: 2D & strings3 min Dynamic programming: 1D3 min

© 2026 Prep Room·From California·AI can make mistakes.

About Legal Contact Cookies Your privacy choices

Home Review Tracks Paths