add_one_row_to_tree.go

package main

// Definition for a binary tree node.
typeTreeNodestruct {
Valint
Left*TreeNode
Right*TreeNode
}

funcaddOneRow(root*TreeNode, valint, depthint) *TreeNode {
ifdepth==1 {
return&TreeNode{
Val: val,
Left: root,
Right: nil,
 }
 }

varqueue []*TreeNode
queue=append(queue, root)

currentDepth:=1

forlen(queue) >0 {
currentDepth++
length:=len(queue)

fori:=0; i<length; i++ {
ifcurrentDepth==depth {
left:=queue[i].Left
right:=queue[i].Right

newLeftNode:=&TreeNode{
Val: val,
Left: nil,
Right: nil,
 }

newRightNode:=&TreeNode{
Val: val,
Left: nil,
Right: nil,
 }

queue[i].Left=newLeftNode
queue[i].Right=newRightNode

newLeftNode.Left=left
newRightNode.Right=right
 }

ifqueue[i].Left!=nil {
queue=append(queue, queue[i].Left)
 }

ifqueue[i].Right!=nil {
queue=append(queue, queue[i].Right)
 }
 }

queue=queue[length:]
 }

returnroot
}