题目:
https://leetcode.com/problems/same-tree/
难度:
Easy
递归
class Solution(object):
def isSameTree(self, p, q):
"""
:type p: TreeNode
:type q: TreeNode
:rtype: bool
"""
if p == None or q == None:
if p == None and q == None:
return True
else:
return False
else:
return p.val == q.val and self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
D101 100. Same Tree 题目链接 100. Same Tree 题目分析 判断给定的两颗树是否相等...
100. Same Tree 题目: https://leetcode.com/problems/same-tre...
100. Same Tree Description Given two binary trees, write ...
100. Same Tree[思路] 二叉树匹配
Part 4 – 杂鱼 100. Same Tree https://leetcode.com/problems/...
分类：Tree 时间复杂度: O(nlogn) 空间复杂度: O(nlogn) 100. Same Tree Gi...
100. Same Tree 判断两棵树是否相同 递归版本 非递归版本 101. Symmetric Tree ...
Problem Given two binary trees, write a function to check...
很简单的题.有多种解法. 注意最后的 p is qis称为同一性运算符,用来比较判断两个对象是否相同,在这里只有p...
本文标题：100. Same Tree
本文链接：https://www.haomeiwen.com/subject/apsfsttx.html
网友评论