2331. Evaluate Boolean Binary Tree

LeetCodeTreeDepth-First SearchBinary TreeOpen on judge ↗

You are given the root of a full binary tree with the following properties: - Leaf nodes have either the value 0 or 1, where 0 represents False and 1 represents True. - Non-leaf nodes have either the value 2 or 3, where 2 represents the boolean OR and 3 represents the boolean AND. The evaluation of a node is as follows: - If the node is a leaf node, the evaluation is the value of the node, i.e

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI