原題地址:https://oj.leetcode.com/problems/same-tree/
題意:判斷兩棵樹是否是同一棵樹。
解題思路:這題比較簡單。用遞歸來做。首先判斷兩個根節點的值是否相同,如果相同,遞歸判斷根的左右子樹。
代碼:
# 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 and q and p.val == q.val: return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right) return False