[LeetCode] N-ary Tree Level Order Traversal N叉树层序遍历

Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example, given a 3-ary tree:
posted @ 2018-09-18 23:59  Grandyang  阅读(3679)  评论(0)    收藏  举报
Fork me on GitHub