dsa3 min read
Sum of Distances in Tree
Compute sum of distances from every node to all others in O(n) using two DFS passes with rerooting technique.
Read →
All Posts
1575 articles
dsa2 min read
Unique Binary Search Trees
Count the number of structurally unique BSTs with n nodes using Catalan numbers and DP.
Read →
dsa2 min read
N-ary Tree Level Order Traversal
Perform level-order traversal of an N-ary tree using BFS, collecting all children at each level.
Read →
dsa1 min read
Binary Tree Pruning
Remove all subtrees that do not contain a 1 by recursively returning null for subtrees with only zeros.
Read →
dsa2 min read
Maximum Level Sum of a Binary Tree
Find the level with the maximum sum using BFS level-order traversal to compute each level's total.
Read →
Page 167 of 315