728x90 2331번1 [LeetCode | Java | Tree 문제 풀이] 2331. Evaluate Boolean Binary Tree - Solution with DFS 99클럽 | 비기너🌲 2331. Evaluate Boolean Binary Tree🏷 Topic : Tree Binary Tree DFS; Depth-First SearchEasyYou are given the root of a full binary tree with the following properties:Leaf nodes have either the value 0 or 1, where 0 represents False and 1 represents True.Non-leaf nodes have either the value 2 or 3, where 2 represents the boolean OR and 3 represents the boolean AND.The evaluation of a n.. 2024. 6. 1. 이전 1 다음 728x90
