每日一道Leetcode - 剑指 Offer 26. 树的子结构

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def isSubStructure(self, A: TreeNode, B: TreeNode) -> bool:
        def recur(A,B):
            # 判断两个树的子结构是否一样
            # 此时B树已经遍历完成，返回True
            if not B:
                return True
            # 如果A树为空，或者A的值与B的值不同的话，返回False
            if not A or A.val != B.val:
                return False
            # 上面判断当前结点是否一样，如果一样则继续判断两个树的左结点以及右结点是否一样
            return recur(A.left,B.left) and recur(A.right,B.right)
        # 判断两树均不为空+B树根结点是A树的根结点的情况｜｜ B树在A树的左子树 ｜｜ B树在A树的右子树
        return bool(A and B) and (recur(A,B) or self.isSubStructure(A.left,B) or self.isSubStructure(A.right,B))