Count Nodes in Complete Binary Tree - Google Top Interview Questions
Problem Statement :
Given a complete binary tree root, return the number of nodes in the tree. This should be done in \mathcal{O}((\log n)^2)O((logn) 2 ). Constraints n ≤ 100,000 where n is the number of nodes in root Example 1 Input root = [1, [2, [4, null, null], [5, null, null]], [3, null, null]] Output 5 Example 2 Input root = [1, [2, [4, null, null], [5, null, null]], [3, [6, null, null], [7, null, null]]] Output 7
Solution :
Solution in C++ :
int solve(Tree* tree) {
int right_h = 0, left_h = 0;
auto* curr = tree;
while (curr) right_h++, curr = curr->right;
curr = tree;
while (curr) left_h++, curr = curr->left;
if (right_h ==
left_h) { // if left_height and right_height is same, then the tree has (2**h - 1) nodes
return (1 << right_h) - 1;
}
// If not same, then again make a recursive call on the left and right subtree
return solve(tree->left) + solve(tree->right) + 1;
}
Solution in Java :
import java.util.*;
/**
* public class Tree {
* int val;
* Tree left;
* Tree right;
* }
*/
class Solution {
public int solve(Tree tree) {
int lo = 1;
int hi = 100000;
while (lo < hi) {
int m = (lo + hi + 1) / 2;
boolean exists = check(tree, m);
if (exists)
lo = m;
else
hi = m - 1;
}
return lo;
}
public boolean check(Tree t, int m) {
boolean active = false;
for (int i = 17; i >= 0; i--) {
int cur = m & (1 << i);
if (!active) {
if (cur > 0)
active = true;
} else {
if (cur == 0)
t = t.left;
else
t = t.right;
if (t == null)
return false;
}
}
return true;
}
}
Solution in Python :
class Solution:
def solve(self, tree):
# function to find the left most depth or the right most depth
def extreme(root, left):
height = 1
if left:
while root:
root = root.left
height += 1
else:
while root:
root = root.right
height += 1
return height
# main function to solve the problem
def traverse(root):
if not root:
return 0
l = extreme(root.left, True)
r = extreme(root.right, False)
if l == r: # encountered a full binary tree
return 2 ** l - 1
else:
return traverse(root.left) + traverse(root.right) + 1
ans = traverse(tree)
return ans
View More Similar Problems
Is This a Binary Search Tree?
For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a
View Solution →Square-Ten Tree
The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the
View Solution →Balanced Forest
Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a
View Solution →Jenny's Subtrees
Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .
View Solution →Tree Coordinates
We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For
View Solution →Array Pairs
Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .
View Solution →