2331Calculate the value of the Boolean binary tree One question daily

topic：

2331Calculate the value of the Boolean binary tree

Thought：

For the currentroot，in the case ofleaf root（That is, the left node is empty），Then judge the current Boolean value（The leaf node must be Boolean instead of judging）。
Otherwise，Until traversing the leaf node，After seeing the left and right children of a sub -tree，Judge the current Valtype，Finally seekingValValue。
ifValNot the root node，butValChildren’s nodes as other trees return to the previous layer。

Code：

class Solution:
    def evaluateTree(self, root: Optional[TreeNode]) -> bool:
        if root.left is None:
            return bool(root.val)
        l = self.evaluateTree(root.left)
        r = self.evaluateTree(root.right)
        return l or r if root.val == 2 else l and r

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

func evaluateTree(root *TreeNode) bool {
	if root.Left == nil {
		return root.Val == 1
	}
	l, r := evaluateTree(root.Left), evaluateTree(root.Right)
	if root.Val == 2 {
		return l || r
	}
	return l && r
}