# 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:
# 當兩個節點都為None意味著情況相同， 回傳真
if p == None and q == None:return True
# 兩個節點有一個為None回傳False
if p == None and q!= None:return False
if p != None and q == None:return False
# 若值不同同樣回傳FALSE
if q.val != p.val : return False
# 最后自身遞回呼叫，分別比較左兒子和右兒子，
return self.isSameTree(p.left,q.left) and self.isSameTree(p.right,q.right)
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/143494.html
標籤：Python
上一篇：力扣中國70題爬樓梯