Available question text
Check whether every node in a binary tree has the same value as the root; return true if all nodes match, false otherwise. This can be done with any tree traversal (DFS/BFS) comparing node values to the initial value.
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
- Average of Levels in Binary Tree
Coding
- Balance a Binary Search Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Grab
Leetcode 965. Univalued Binary Tree
Reported Sep 3, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source