/*
 * @lc app=leetcode.cn id=429 lang=golang
 *
 * [429] N 叉树的层序遍历
 */

// @lc code=start
/**
 * Definition for a Node.
 * type Node struct {
 *     Val int
 *     Children []*Node
 * }
 */

func levelOrder(root *Node) (res [][]int) {
	nodes := []*Node{root}
	for len(nodes) > 0 {
		var temp []int
		var tempNodes []*Node
		for i := 0; i < len(nodes); i++ {
			if nodes[i] != nil {
				temp = append(temp, nodes[i].Val)
				tempNodes = append(tempNodes, nodes[i].Children...)
			}
		}
		if temp != nil {
			res = append(res, temp)
		}
		nodes = tempNodes
	}
	return
}

// @lc code=end