Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Balanced Binary Tree
Coding · Binary Tree · Depth-First Search · Tree
- Binary Search Tree to Greater Sum Tree
Coding · Binary Search Tree · Binary Tree · Depth-First Search
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Anduril
Leetcode 1145. Binary Tree Coloring Game
Reported May 1, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Anduril
Binary Tree Coloring Game
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 65.6. This is not an interview probability.
View source