2331. Evaluate Boolean Binary Tree
Easy
10 Points
Tree
Depth-First Search
Binary Tree
You are given the root of a full binary tree with the following properties:
The evaluation of a node is as follows:
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.
Examples
Example 1
Input: root = [2,1,3,null,null,0,1]
Output: true
Explanation: The above diagram illustrates the evaluation process.
The AND node evaluates to False AND True = False.
The OR node evaluates to True OR False = True.
The root node evaluates to True, so we return true.
Example 2
Input: root = [0]
Output: false
Explanation: The 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 <= 3Every node has either 0 or 2 children.Leaf nodes have a value of 0 or 1.Non-leaf nodes have a value of 2 or 3.
2331. Evaluate Boolean Binary Tree
Easy
10 Points
Tree
Depth-First Search
Binary Tree
You are given the root of a full binary tree with the following properties:
The evaluation of a node is as follows:
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.
Examples
Example 1
Input: root = [2,1,3,null,null,0,1]
Output: true
Explanation: The above diagram illustrates the evaluation process.
The AND node evaluates to False AND True = False.
The OR node evaluates to True OR False = True.
The root node evaluates to True, so we return true.
Example 2
Input: root = [0]
Output: false
Explanation: The 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 <= 3Every node has either 0 or 2 children.Leaf nodes have a value of 0 or 1.Non-leaf nodes have a value of 2 or 3.