思路
简单递归
code
func mergeTrees(t1 *TreeNode, t2 *TreeNode) *TreeNode {
if t1 == nil {
return t2
}
if t2 == nil {
return t1
}
t1.Left = mergeTrees(t1.Left, t2.Left)
t1.Right = mergeTrees(t1.Right, t2.Right)
t1.Val += t2.Val
return t1
}
更多内容请移步我的repo:https://github.com/anakin/golang-leetcode