leetcode-python-相同的树

概述递归#Definitionforabinarytreenode.#classTreeNode:#def__init__(self,val=0,left=None,right=None):#self.val=val#self.left=left#self.right=rightclassSolution:defisSameTree(self,p:TreeNode,q:Tr

递归

# 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 = rightclass Solution:    def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:        if not p and not q:            return True        if not p:            return False        if not q:            return False        if p.val != q.val:            return False        return self.isSameTree(p.left,q.left) and self.isSameTree(p.right,q.right)

 

总结

以上是内存溢出为你收集整理的leetcode-python-相同的树全部内容，希望文章能够帮你解决leetcode-python-相同的树所遇到的程序开发问题。

如果觉得内存溢出网站内容还不错，欢迎将内存溢出网站推荐给程序员好友。