判断两棵树一样

# 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) or (p!=None and q==None):return False
        else:
            if p.val=q.val:
                return Solution.isSameTree(self, p.left, q.left) and Solution.isSameTree(self, p.left, q.left)
            else:
            return False