[LeetCode/Easy] 2331. Evaluate Boolean Binary Tree

1. Input

1) TreeNode root

 

2. Output

1) root에 있는 조건식을 계산한 결과를 반환

- leaf node: 0(false), 1(true)

- non-leaf node: 2(OR), 3(AND)

 

3. Constraint

1) 노드 수의 범위는 [1, 1000]이다.

2) 0 <= Node.val <= 3

3) root는 full binary tree이기 때문에 모든 노드의 자식은 0개 또는 2개이다.

 

4. Example

Input: root = [2,1,3,null,null,0,1] -> Output: true

 

5. Code

1) 첫 코드(2023/06/26)

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean evaluateTree(TreeNode root) {
        boolean ans;
        if(root.val==2)
            ans = evaluateTree(root.left) || evaluateTree(root.right);
        else if(root.val==3)
            ans = evaluateTree(root.left) && evaluateTree(root.right);
        else if(root.val==0)
            ans = false;
        else
            ans = true;
        return ans;
    }
}

- 100%, 44%