dsa2 min read
Add One Row to Tree
Insert a new row of nodes at a given depth in a binary tree using BFS to reach the target depth level.
Read →
All Posts
1575 articles
dsa1 min read
Deepest Leaves Sum
Sum all nodes at the deepest level of a binary tree using BFS to process level by level.
Read →
dsa2 min read
Cousins in Binary Tree
Determine if two nodes are cousins (same depth, different parents) using BFS to track depth and parent.
Read →
dsa2 min read
Number of Nodes in a Complete Binary Tree (Optimized)
Count nodes in complete binary tree in O(log^2 n) by comparing left vs right subtree heights recursively.
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 →
Page 170 of 315