# Definition for a binary tree node. # class TreeNode: # def __init__(self,x): # self.val = x # self.left = None # self.right = None class Solution: def mergeTrees(self,t1: TreeNode,t2: TreeNode) -> TreeNode: if t1!=None and t2!=None: t1.val+=t2.val t1.left = self.mergeTrees(t1.left,t2.left) t1.right = self.mergeTrees(t1.right,t2.right) elif t1==None and t2!=None: return t2 elif t1!=None and t2==None: return t1 else: return None return t1@H_502_0@时间空间消耗: @H_502_0@
@H_502_0@以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持我们。