【LeetCode】100. 相同的树

给定两个二叉树，编写一个函数来检验它们是否相同。

如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。

示例 1:

输入:       1         1
          / \       / \
         2   3     2   3

        [1,2,3],   [1,2,3]

输出: true

示例 2:

输入:      1          1
          /           \
         2             2

        [1,2],     [1,null,2]

输出: false

示例 3:

输入:       1         1
          / \       / \
         2   1     1   2

        [1,2,1],   [1,1,2]

输出: false

#!/usr/bin/python3
# -*- coding: utf-8 -*-
# @Time: 2018/7/26
# @Author: xfLi
# The file...

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

def isSameTree(p, q):
    """
    :type p: TreeNode
    :type q: TreeNode
    :rtype: bool
    """
    if p == None and q == None: # 二叉树皆为空，递归边界，两者皆为空返回真
        return True

    if p == None or q == None:
        return False

    if p.val == q.val:
        return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)
    else:
        return False

if __name__ == '__main__':
    p = TreeNode(x=1, left=TreeNode(3), right=TreeNode(3))
    q = TreeNode(x=1, left=TreeNode(3), right=TreeNode(3))
    result = isSameTree(p,q)
    print(result)