简述 合并2个二叉树。merge-two-binary-trees 英文 中文 收获 1.判断空树2.递归3.TreeNode , self. 代码 12345678910111213141516 # class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass : def mergeTrees(self, t1, t2): if t1 and t2: root = TreeNode(t1.val + t2.val) root.left = self.mergeTrees(t1.left, t2.left) root.right = self.mergeTrees(t1.right, t2.right) return root else: return t1 or t2 赞微海报分享
近期评论