**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 :

` ````
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

## Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →## Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

View Solution →## Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →## Kindergarten Adventures

Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti

View Solution →## Mr. X and His Shots

A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M

View Solution →## Jim and the Skyscrapers

Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space

View Solution →