leetcode7——另一个树的子树

class Solution:
    def isSame(self,s,t):
        if not s and not t:
            return True
        if not s or not t:
            return False
        return s.val==t.val and self.isSame(s.left,t.left) and self.isSame(s.right,t.right)
    def isSubtree(self, s: TreeNode, t: TreeNode) -> bool:
        queue=[]
        queue.append(s)
        flag=0
        while queue:
            node=queue.pop(0)
            if node.left is not None:
                queue.append(node.left)
            if node.right is not None:
                queue.append(node.right)
            if node.val==t.val:
                if self.isSame(node,t) is True:
                    flag=1
                    break
        if flag==0:
            return False
        else:
            return True