Evaluate Boolean Binary Tree
You are given the root of a full binary tree with the following properties:
- Leaf nodes have either the value
0or1, where0representsFalseand1representsTrue. - Non-leaf nodes have either the value
2or3, where2represents the booleanORand3represents the booleanAND.
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.
TrueorFalse. - Otherwise, evaluate the node's two children and apply the boolean operation of its value with the children's evaluations.
Return the boolean result of evaluating the root node.
A full binary tree is a binary tree where each node has either 0 or 2 children.
A leaf node is a node that has zero children.
Example 1
2
/ \
1 3
/ \
0 1Input
root = [2,1,3,null,null,0,1]Output
trueThe AND node evaluates to False AND True = False, then the OR root evaluates to True OR False = True.
Example 2
0
Input
root = [0]Output
falseThe root node is a leaf node and it evaluates to false, so we return false.
Constraints
- The number of nodes in the tree is in the range
[1, 1000]. 0 <= Node.val <= 3- Every node has either
0or2children. - Leaf nodes have a value of
0or1. - Non-leaf nodes have a value of
2or3.