Search in a Virtually Complete Binary Tree- Google Top Interview Questions


Problem Statement :


Consider a complete binary tree of n nodes whose values are 1 to n. The root has value of 1, its left child is 2 and its right child is 3. In general, nodes' values are labelled 1 to n in level order traversal.

You are given a binary tree root and an integer target. Given that the root was originally a complete binary tree whose values were labelled as described above, and that some of the subtrees were deleted, return whether target exists in root.

Bonus: solve in \mathcal{O}(h)O(h) time where h is the height of the tree.

Constraints

1 ≤ n ≤ 100,000 where n is the number of nodes in root

Example 1

Input

root = [1, [2, [4, null, null], null], [3, [6, null, null], [7, null, null]]]
target = 6

Output

True

Explanation

6 exists in this tree.

Example 2

Input

root = [1, [2, [4, null, null], null], [3, [6, null, null], null]]

target = 7

Output

False

Explanation

7 does not exist in this tree.


Solution :



title-img 




                        Solution in C++ :

*/
bool check(Tree* root, vector<int>& path) {
    while (root) {
        if (root->val != path.back()) return false;
        path.pop_back();
        if (path.empty()) return true;
        if (path.back() % 2)
            root = root->right;
        else
            root = root->left;
    }
    return false;
}

bool solve(Tree* root, int target) {
    if (target < 1) return false;
    vector<int> path{target};
    for (int i = target; i != 1;) {
        i /= 2;
        path.push_back(i);
    }
    return check(root, path);
}
                    


                        Solution in Java :

import java.util.*;

/**
 * public class Tree {
 *   int val;
 *   Tree left;
 *   Tree right;
 * }
 */
class Solution {
    public boolean solve(Tree root, int target) {
        if (target <= 0)
            return false;

        // we can construct the path to target
        LinkedList<Integer> path = new LinkedList();
        int tmp = target;
        while (tmp != 1) {
            path.addFirst(tmp);
            tmp = tmp / 2;
        }
        Tree trav = root;
        while (path.size() > 0) {
            int num = path.removeFirst();
            if (num % 2 == 0) {
                if (trav.left == null)
                    return false;
                trav = trav.left;
            } else {
                if (trav.right == null)
                    return false;
                trav = trav.right;
            }
        }
        return true;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, root, target):
        if target == 0:
            return False
        path = []
        while target > 1:
            if target % 2:
                path.append(1)
            else:
                path.append(-1)
            target //= 2
        for x in path[::-1]:
            if x == -1:
                if root.left is None:
                    return False
                root = root.left
            else:
                if root.right is None:
                    return False
                root = root.right
        return True


View More Similar Problems

Insert a node at a specific position in a linked list

Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its data attribute, insert this node at the desired position and return the head node. A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is e

View Solution →

Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

View Solution →

Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

View Solution →

Reverse a linked list

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio

View Solution →

Compare two linked lists

You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis

View Solution →

Merge two sorted linked lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C

View Solution →