將兩個二叉樹相同位置的數值相加，相加的方法一樣，則使用遞歸法挨個相加即可。

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = Noneclass Solution:def mergeTrees(self, t1, t2):""":type t1: TreeNode:type t2: TreeNode:rtype: TreeNode"""if not t1 and not t2:return Nonet = TreeNode((t1.val if t1 else 0)+(t2.val if t2 else 0))if t.left:t.left = self.mergeTrees(t1.left, t2.left)if t.right:t.right = self.mergeTrees(t1.right, t2.right)return t

更優寫法：

t1 and t1.left

def mergeTrees(self, t1, t2):if not t1 and not t2: return Noneans = TreeNode((t1.val if t1 else 0) + (t2.val if t2 else 0))ans.left = self.mergeTrees(t1 and t1.left, t2 and t2.left)ans.right = self.mergeTrees(t1 and t1.right, t2 and t2.right)return ans

總結

以上是生活随笔為你收集整理的3/100. Merge Two Binary Trees的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。