leetcode:Same Tree【Python版】

1、p或q为None的情况用开始的两个if语句进行判断；

2、类中递归调用函数需要使用self进行调用；

3、代码很简洁，最后几行通过同时为None和同时非None的条件进行判断；

 # Definition for a  binary tree node
 # class TreeNode:
 #     def __init__(self, x):
 #         self.val = x
 #         self.left = None
 #         self.right = None

 class Solution:
     # @param p, a tree node
     # @param q, a tree node
     # @return a boolean
     def isSameTree(self, p, q):
         if p==None and q==None:
             return True
         if p==None or q==None:
             return False
         v = p.val==q.val
         l = (p.left==None and q.left==None)
         r = (p.right==None and q.right==None)
         if p.left!=None and q.left!=None:
             l = self.isSameTree(p.left,q.left)
         if p.right!=None and q.right!=None:
             r = self.isSameTree(p.right,q.right)
         return v and l and r