# Evaluate Boolean Binary Tree: Explained

Evaluate Boolean Binary Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Leaves are 0/1; inner nodes are OR (2) or AND (3). Recursively evaluate left and right and apply the node operator. Short-circuiting AND/OR is optional.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Treating the node values as the result without looking at children, or swapping AND/OR.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at here.