[LeetCode] N-ary Tree Preorder Traversal N叉树的前序遍历

Given an n-ary tree, return the preorder traversal of its nodes' values. For example, given a 3-ary tree: Return its preorder traversal as: [1,3,5,6,2