Tree Coloring - Amazon Top Interview Questions


Problem Statement :


You are given a binary tree root where the value of each node represents its color. In the tree there are at most 2 colors. Return whether it's possible to swap the colors of the nodes any number of times so that no two adjacent nodes have the same color.

Constraints

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

Example 1

Input

root = [1, [1, null, null], [1, [0, null, [0, null, null]], [0, null, null]]]

Output

True

Explanation

We can color the root with 0, the next level 1s, third level 0s and fourth level 1s

Example 2

Input

root = [5, null, [9, [5, null, null], [9, null, null]]]

Output

False

There's no way to color the nodes so that no two adjacent nodes have the same color.


Solution :



title-img 




                        Solution in C++ :

/**
 * class Tree {
 *     public:
 *         int val;
 *         Tree *left;
 *         Tree *right;
 * };
 */

int dfs(Tree *root, int color) {
    if (!root) return 0;
    return color + dfs(root->left, 1 - color) + dfs(root->right, 1 - color);
}

void countNodes(Tree *root, int firstColor, int &firstCount, int &secondCount) {
    if (!root) return;

    if (root->val == firstColor)
        ++firstCount;
    else
        ++secondCount;

    countNodes(root->left, firstColor, firstCount, secondCount);
    countNodes(root->right, firstColor, firstCount, secondCount);
}

bool solve(Tree *root) {
    if (!root) return true;

    int req = dfs(root, 1), firstColor = root->val, firstCount = 0, secondCount = 0;
    countNodes(root, firstColor, firstCount, secondCount);
    return req == firstCount || req == secondCount;
}
                    




                        Solution in Python : 
                            
# class Tree:
#     def __init__(self, val, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def solve(self, root):
        if not root:
            return True
        evens = 0  # how many nodes are in even layers
        tot = 0  # how many total nodes there are
        firstCnt = 0  # how many nodes have the "first" color
        first = root.val  # we assign the root node's color to be the first color
        q = collections.deque([(root, 0)])
        while q:
            curr, lvl = q.popleft()
            tot += 1
            if curr.val == first:
                firstCnt += 1
            if lvl % 2:
                evens += 1
            if curr.left:
                q.append((curr.left, lvl + 1))
            if curr.right:
                q.append((curr.right, lvl + 1))
        return evens in [
            firstCnt,
            tot - firstCnt,
        ]  # the even layers can get the first or second color


View More Similar Problems

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 →

Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

View Solution →

Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →

Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →