Leetcode572. 另一棵树的子树 Subtree of Another Tree - Python 迭代法

思路：

判断subTree是不是root的子树：

1.root 是否等于 subTree

2.若1不成立，subTree是否是root左子树的子树

3.若2不成立，subTree是否是root右子树的子树

三者是 或 or 关系

判断subTree是否与root相等：

1.root.val == subTree.val

2.root左子树 等于 subTree左子树

3.root右子树 等于 subTree右子树

三者是 和 and 关系

# 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 isSubtree(self, root: Optional[TreeNode], subRoot: Optional[TreeNode]) -> bool:
        if not root and not subRoot: return True
        if not root or not subRoot: return False
        return self.compare(root, subRoot) or self.isSubtree(root.left, subRoot) or self.isSubtree(root.right, subRoot)
    
    def compare(self, root: 'TreeNode', subRoot: 'TreeNode') -> bool:
        if not root and not subRoot: return True
        if not root or not subRoot: return False
        return root.val == subRoot.val and self.compare(root.left, subRoot.left) and self.compare(root.right, subRoot.right)