100. Same Tree Leetcode Python

Given two binary trees, write a function to check if they are equal or not.


Two binary trees are considered equal if they are structurally identical and the nodes have the same value

这道题目考察的是树的比较和遍历。可以采用任何一种遍历方式,只要能保证比较到树中的所有节点.只要有任何一个节点不符合条件就返回false

这里采用Preorder的方法。

We need to traverse the whole tree and compare every value of the two trees. If any of the value is not the same return False

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

class Solution:
    # @param p, a tree node
    # @param q, a tree node
    # @return a boolean
    def isSameTree(self, p, q):
        if q==None and p==None:
            return True
        if q and p and p.val==q.val:
           return self.isSameTree(p.left,q.left) and self.isSameTree(p.right,q.right)
        return False
        
        

这里用非recursive的方法解决,主要思想是用两个stack来maintain node 

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

class Solution:
    # @param p, a tree node
    # @param q, a tree node
    # @return a boolean
    def isSameTree(self, p, q):
        if p==None and q==None:
            return True
        if p==None and q!=None:
            return False
        if p!=None and q==None:
            return False
        stack1=[p]
        stack2=[q]
        while stack1 and stack2:
            n1=stack1.pop()
            n2=stack2.pop()
            if n1.val==n2.val:
                if n1.left:
                    stack1.append(n1.left)
                if n2.left:
                    stack2.append(n2.left)
                if len(stack1)!=len(stack2):
                    return False
                if n1.right:
                    stack1.append(n1.right)
                if n2.right:
                    stack2.append(n2.right)
                if len(stack1)!=len(stack2):
                    return False
            else:
                return False
                
        return True
        




  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值