2331. Evaluate Boolean Binary Tree
Easy
You are given the root
of a full binary tree with the following properties:
Leaf nodes have either the value
0
or1
, where0
representsFalse
and1
representsTrue
.Non-leaf nodes have either the value
2
or3
, where2
represents the booleanOR
and3
represents 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.
True
orFalse
.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:
Example 2:
Constraints:
The number of nodes in the tree is in the range
[1, 1000]
.0 <= Node.val <= 3
Every node has either
0
or2
children.Leaf nodes have a value of
0
or1
.Non-leaf nodes have a value of
2
or3
.
解題
Last updated