JAVA_LeetCode 2331_Evaluate Boolean Binary Tree 풀이 class Solution { public boolean evaluateTree(TreeNode root) { // 2보다 작으면, 논리값을, 2, 3일땐 리프노드 값의 연산값을 반환한다. if(root.val < 2) return root.val == 1; if(root.val == 2) return evaluateTree(root.left) || evaluateTree(root.right); return evaluateTree(root.left) && evaluateTree(root.right); } } * 출처 https://leetcode.com/problems/evaluate-boolean-binary-tree...
#
JAVA
#
JAVA_EvaluateBooleanBinaryTree
#
JAVA_LeetCode2331
#
JAVA_LeetCode2331_EvaluateBooleanBinaryTree
#
LeetCode2331_EvaluateBooleanBinaryTree
