How should I practice Alternating-Color Binary Tree Roots?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Alternating-Color Binary Tree Roots associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Tree

Alternating-Color Binary Tree Roots

● Medium

GoogleFULLTIMEONSITE INTERVIEW

See Google hiring insights

Problem statement

You are given a connected undirected tree with nodes numbered from 0 through n - 1. The array edges contains its undirected edges, and colors[i] is either B or W for node i.

The problem statement continues

Pro

Examples

Example 1

n = 5edges = [[0,1],[1,2],[1,3],[3,4]]colors = "BWBWW"return = []

Nodes 3 and 4 have the same color even though they are adjacent, so no root can make every adjacent level alternate.

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week