面试题 04.10.检查子树

面试题 04.10.检查子树

题目描述

代码实现

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

class Solution:
    def checkSubTree(self, t1: TreeNode, t2: TreeNode) -> bool:
        # t1, t2判空顺序不能变
        if not t2:
            return True
        if not t1:
            return False

        if t1.val == t2.val:
            return self.checkSubTree(t1.left, t2.left) and self.checkSubTree(t1.right, t2.right)
        else:
            return self.checkSubTree(t1.left, t2) or self.checkSubTree(t1.right, t2)

参考

非常优雅的前端解法，看不懂我打你