美文网首页
100. Same Tree

100. Same Tree

作者: a_void | 来源:发表于2016-09-08 11:48 被阅读0次

    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.

    # Definition for a binary tree node.
    # class TreeNode(object):
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None
    
    class Solution(object):
        def isSameTree(self, p, q):
            """
            :type p: TreeNode
            :type q: TreeNode
            :rtype: bool
            """
            if p == None and q == None:
                return True
            elif p != None and q != None and p.val == q.val:
                return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
            else:
                return False
    

    相关文章

      网友评论

          本文标题:100. Same Tree

          本文链接:https://www.haomeiwen.com/subject/kyusettx.html