这类题非常陌生,不过有好多个类似题可以用来反复练习,从这开始
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:
if not p and not q:return True
if not p or not q:return False
if p.val != q.val:return False
return self.isSameTree(p.left,q.left) and \
self.isSameTree(p.right,q.right)