leetcode之Same Tree

这题就是来看每个节点的值想不想等。看一下左树的值，再看下右树的值来判断的。代码如下：

# 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:
if q == None:
return True
else:
return False
else:
if q == None:
return False
if type(p) != type(q):
return False
leftsum = rightsum = True
if p.val != q.val:
return False
else:
if p.left != None:
if q.left != None:
if p.left.val != q.left.val:
return False
else:
leftsum = self.isSameTree(p.left, q.left)
else:
return False
else:
if q.left != None:
return False
if p.right != None:
if q.right != None:
if p.right.val != q.right.val:
return False
else:
rightsum = self.isSameTree(p.right, q.right)

else:
return False
else:
if q.right != None:
return False
return leftsum & rightsum