题目描述
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.
You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.
Example 1:
1 |
Input: |
Note: The merging process must start from the root nodes of both trees.
解题思路
- 同时递归先序遍历t1和t2
- 如果t1和t2都不为nil,将t1.val+=t2.val,返回t1
- 如果t1为nil, t2非nil,返回t2
- 其他返回t1
Go实现
Go递归实现
1 |
func (t1 *TreeNode, t2 *TreeNode) *TreeNode { |
Runtime: 62 ms 72.46%
近期评论