应用题-二叉树专题-合并二叉树
- 版权声明：本站原创文章，于2026-04-02，由 管理员 发表。
- 转载请注明： 应用题-二叉树专题-合并二叉树 | CodeGarden
```python
# 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 and not root2: return None
# 若处于同一层时 两棵树任意一个根节点为none 直接使用不为空的树
if root1 and not root2: return root1
if root2 and not root1: return root2
root = TreeNode( root1.val + root2.val )
root.left = self.mergeTrees( root1.left, root2.left )
root.right = self.mergeTrees( root1.right, root2.right )
return root
```