两个二叉树的合并
原题链接
解题思路:
递归代码看这简单,但是实操起来是很难想到的,要多次迭代才能写好,
递归的三步法:
1》确定递归函数的参数和返回值
2》确定返回值
3》确定递归的单层的循环逻辑
代码实现:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def mergeTrees(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]:
if not root1:
return root2
if not root2:
return root1
root1.val += root2.val # 中
root1.left=self.mergeTrees(root1.left,root2.left) # 左
root1.right=self.mergeTrees(root1.right,root2.right) # 右
return root1