Intuition Rewire

Home Roadmap Visualizer & Lessons Dry-Run Engine Pricing

Esc

Loading…

↑ ↓ to moveEnter to openEsc to close

Learning Path

Sign in Sign up free

Home Roadmap Visualizer & Lessons Dry-Run Engine Pricing Learning Path

Binary Search Tree

Introduction to binary search trees

What is a binary search tree?
Searching and inserting
Deleting a node: the three cases
Traversals: why in-order comes out sorted
Balance, height and memory

Pattern 1 · Core operations

Search in a Binary Search Tree
Range Sum of BST
Insert into a Binary Search Tree
Delete Node in a BST

Pattern 2 · Using the BST property

Floor and Ceil in a BST
Validate Binary Search Tree
Lowest Common Ancestor of a Binary Search Tree
Trim a Binary Search Tree

Pattern 3 · In-order is sorted

Minimum Absolute Difference in BST
Two Sum IV - Input is a BST
Kth Smallest Element in a BST
Binary Search Tree Iterator
Recover Binary Search Tree

Pattern 4 · Building BSTs

Convert Sorted Array to Binary Search Tree
Construct BST from Preorder Traversal
Balance a Binary Search Tree
Unique Binary Search Trees

Pattern 5 · Successors, serialization and hard problems

Inorder Successor in BST
Serialize and Deserialize BST
Maximum Sum BST in Binary Tree

Intuition Rewire— Algorithmic Mental Models & Hardware Diagnostics

Privacy Terms Refunds Contact

© 2026 Intuition Rewire. Systematic Engineering Mastery.