问题描述:
python:
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution(object):
def isSameTree(self, p, q):
"""
:type p: TreeNode
:type q: TreeNode
:rtype: bool
"""
# If both nodes are None, the trees are identical
if not p and not q:
return True
# If one of the nodes is None or the values differ, trees are not identical
if not p or not q or p.val != q.val:
return False
# Recursively check left and right subtrees
return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)