【题目】
【代码】
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def postOrder(self,root):
if not root:return
self.postOrder(root.left)
self.postOrder(root.right)
if root.val==2:#or
root.val=root.left.val or root.right.val
elif root.val==3:#and
root.val=root.left.val and root.right.val
def evaluateTree(self, root: Optional[TreeNode]) -> bool:
self.postOrder(root)
return root.val==1