dsa2 min read
Two Sum IV - BST — Hash Set + In-Order Traversal
Find if a BST contains two nodes summing to target using a hash set during DFS traversal.
Read →
Bst
20 articles
dsa1 min read
Convert Sorted List to BST — Fast/Slow + Recursion
Convert a sorted linked list to a height-balanced BST by repeatedly finding the middle node as root.
Read →
dsa2 min read
Convert Sorted List to BST — In-Order O(n) Build
Build a balanced BST from a sorted list in O(n) by counting nodes, building in-order, and consuming list nodes.
Read →
dsa1 min read
Range Sum of BST — BST Property Pruning DFS
Sum all BST values in [low, high] using BST property to prune entire subtrees outside the range.
Read →
dsa1 min read
Search in a Binary Search Tree — BST Property Navigation
Find a node with given value in a BST by navigating left or right based on the BST property.
Read →
dsa1 min read
Validate Binary Search Tree — Min/Max Bounds DFS
Validate a BST by passing down min and max bounds through DFS, ensuring every node falls strictly within its valid range.
Read →
dsa1 min read
Kth Smallest Element in a BST — Inorder Traversal
Find the kth smallest element in a BST using inorder traversal (left-root-right) which visits nodes in sorted order.
Read →
dsa1 min read
Lowest Common Ancestor of BST — BST Property Navigation
Find the LCA in a BST in O(h) by navigating left or right based on whether both nodes are in the same subtree.
Read →
dsa3 min read
Delete Node in a BST
Find and delete a node from a BST while maintaining BST properties using in-order successor.
Read →
dsa2 min read
Convert BST to Greater Tree
Replace each node value with the sum of all values greater than or equal to it using reverse in-order traversal.
Read →
dsa2 min read
Trim a Binary Search Tree
Trim a BST so all values lie within [low, high] by recursively pruning out-of-range subtrees.
Read →
dsa3 min read
Serialize and Deserialize BST
Serialize a BST to a compact preorder string and reconstruct it using the min-max BST property.
Read →
dsa2 min read
Recover Binary Search Tree
Find and swap the two misplaced nodes in a BST using in-order traversal to detect the violations.
Read →
dsa2 min read
Maximum Sum BST in Binary Tree
Find the maximum sum of any BST subtree within a binary tree using post-order DFS returning subtree metadata.
Read →
dsa2 min read
Construct Binary Search Tree from Preorder Traversal
Reconstruct a BST from its preorder traversal in O(n) using min-max bounds to place each node.
Read →
dsa2 min read
Binary Search Tree Iterator
Implement an in-order BST iterator with O(h) space using a stack to simulate recursive in-order traversal.
Read →
dsa2 min read
Closest Binary Search Tree Value II
Find k values closest to target in a BST using two in-order iterators (forward and reverse) with a two-pointer merge.
Read →
dsa1 min read
Inorder Successor in BST II
Find the inorder successor of a node in a BST when you have access to parent pointers.
Read →
dsa1 min read
Insert into a Binary Search Tree
Insert a value into a BST by traversing left/right based on comparisons until reaching a null position.
Read →
dsa1 min read
Increasing Order Search Tree
Rearrange a BST into a right-skewed tree with no left children using in-order traversal.
Read →