题解 | #判断二叉树是否相等#

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

#
# 
# @param p TreeNode类 
# @param q TreeNode类 
# @return bool布尔型
#
class Solution:
    def isSameTree(self , p , q ):
        # write code here
        if p is None and q is None:
            return True
        if p is None or q is None:
            return False
        if p.val != q.val:
            return False
        return Solution.isSameTree(self, p.left, q.left) and Solution.isSameTree(self, p.right, q.right)