dsa2 min read
Unique Binary Search Trees II
Generate all structurally unique BSTs with values 1 to n using divide and conquer with memoization.
Read →
All Posts
1575 articles
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
Vertical Order Traversal of a Binary Tree
Group tree nodes by vertical column then row, sorting by value within same position using BFS with coordinates.
Read →
dsa3 min read
Step-By-Step Directions From a Binary Tree Node to Another
Find path directions between two tree nodes by finding LCA then building paths from LCA to each target.
Read →
Page 163 of 315