Available question text
Given a full binary tree where leaves are boolean constants (0 = False, 1 = True) and internal nodes are operators (2 = OR, 3 = AND), compute the boolean value of the root by recursively evaluating each node's children and applying its operator. This is essentially evaluating an expression tree (post-order traversal) on up to ~1000 nodes.
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
No company association
Leetcode 2331. Evaluate Boolean Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source