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 →
All Posts
1276 articles
dsa2 min read
N-ary Tree Preorder and Postorder Traversal
Traverse an N-ary tree in preorder and postorder using DFS with a stack or recursion.
Read →
dsa2 min read
Construct Quad Tree
Build a quad tree from a 2D grid by recursively checking if a region is uniform and splitting into four quadrants.
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 →
dsa1 min read
Count Nodes Equal to Average of Subtree
Count nodes where node value equals the average of all values in its subtree using post-order DFS returning sum and count.
Read →
Page 111 of 256