dsa2 min read
Path Sum IV
Sum all root-to-leaf path sums in a tree encoded as 3-digit integers using a hashmap to decode tree structure.
Read →
All Posts
1276 articles
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 →
dsa2 min read
Binary Tree Upside Down
Transform a binary tree so every right child becomes a sibling and left child becomes parent using iterative rotation.
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 →
dsa2 min read
Second Minimum Node In a Binary Tree
Find second minimum value in a special binary tree where root is min and each node equals min of its children.
Read →
Page 109 of 256