Binary Search Tree Problems

Practise 25 binary search tree problems from basics to advanced in Python, C++, Java, JavaScript and TypeScript.

This track covers searching, inserting and deleting keys, validating a tree, in-order tricks, balancing and iterators. The problems run from easy to hard, so each idea builds on the one before. Every problem is judged against hidden test cases in five languages.

What you will practise:

• Basics: 9 easy problems such as Find in the Search Tree, Range Key Total and Search Trail.
• Core Problems: 11 medium problems such as Grow the Search Tree, Ordered Iterator and Every Tree Shape.
• Hard Problems: 5 hard problems such as Richest Search Subtree, Insertion Depth Ledger and Cheapest Lookup Tree.

Start with the basics, move on to the core problems, and try the hard ones when the pattern feels natural. Every problem comes with worked examples and clear constraints. For a full path across all of DSA, see Revquix 80, Revquix 150 and Revquix 300.