本文给出了617合并两个二进制树为什么是我的解决方案不工作

Question

def mergeTrees(self, t1, t2): 
    """ 
    :type t1: TreeNode 
    :type t2: TreeNode 
    :rtype: TreeNode 
    """ 
    if t1 is None and t1 is None: 
     return None 
    val1=t1.val if t1!=None else 0 
    val2=t2.val if t2!=None else 0 
    val=val1+val2 
    newNode=TreeNode(val) 
    newNode.left=self.mergeTrees(None if t1 is None else t1.left, None if t2 is None else t2.left) 
    newNode.right=self.mergeTrees(None if t1 is None else t1.right, None if t2 is None else t2.right) 
    return newNode 

你输入

[1,3,2,5] [2,1,3，空4，空，7] 你的回答

[3,4,5,5] 预期的答案

[3,4,5,5,4，空，7]

Answer 1

有这条线一个错字 - >if t1 is None and t1 is None:

应该if t1 is None and t2 is None: