牛客题霸 NC15 求二叉树的层序遍历

Posted 2021-09-04 Starzkg

https://www.nowcoder.com/practice/04a5560e43e24e9db4595865dc9c63a3

解决方案

Go

func levelOrder(root *TreeNode) [][]int {
	// write code here
	NC15dfs(root, 0)
	return NC15ans
}

var NC15ans = make([][]int, 0)

func NC15dfs(pRoot *TreeNode, num int) {
	if pRoot == nil {
		return
	}
	if len(NC15ans) == num {
		NC15ans = append(NC15ans, []int{})
	}
	NC15ans[num] = append(NC15ans[num], pRoot.Val)
	NC15dfs(pRoot.Left, num+1)
	NC15dfs(pRoot.Right, num+1)
}

参考文章