nary_tree_level_order_traversal

2022-12-14 浏览 (714)

nary_tree_level_order_traversal.go 源码

package leetcode

import "container/list"

/N叉树的层次遍历

func levelOrder(root *Node) [][]int {
	var res [][]int
	if root == nil {
		return res
	}

	queue := list.New()
	queue.PushBack(root)
	for queue.Len() > 0 {
		var curLevel []int
		n := queue.Len()
		for i := 0; i < n; i++ {
			e := queue.Front()
			queue.Remove(e)

			node := e.Value.(*Node)
			curLevel = append(curLevel, node.Val)
			for _, child := range node.Children {
				queue.PushBack(child)
			}
		}
		res = append(res, curLevel)
	}
	return res
}

你可能感兴趣的文章

binary_tree_inorder_traversal

binary_tree_level_order_traversal

binary_tree_postorder_traversal

  • 所属分类： 后端技术
  • 本文标签： 技术
  • 版权声明： 本文链接 https://seaxiang.com/blog/e87853f3cc4c412ba9970e911ed3ca40
^