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 :



title-img 




                        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

Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →

Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

View Solution →

Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

View Solution →

Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

View Solution →

Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

View Solution →

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 →