https://leetcode-cn.com/problems/same-tree/ (opens new window) 需要注意的点

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:
        if not p and not q:
            return True

        if (not p or not q) or p.val != q.val:
            return False

         

        def reverseTree(n1: TreeNode, n2: TreeNode)->bool:
            if not n1 or not n2:   
                return n1 == n2
            
            if n1.val != n2.val:
                return False
            
            return reverseTree(n1.left, n2.left) and reverseTree(n1.right, n2.right)

        
        return reverseTree(p, q)