Search
⌘K
Get Premium
Leetcode 1145. Binary Tree Coloring Game
Given a binary tree and the node x chosen by player 1, determine whether player 2 can pick a node y that guarantees victory by seizing a region larger than n/2 — i.e., one of the three disjoint areas created by removing x (its left subtree, its right subtree, or the remainder of the tree).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.