1. 题目原址
https://leetcode.com/problems/n-ary-tree-preorder-traversal/
2. 题目描述
3. 题目大意
前序遍历一个N叉树
4. 解题思路
通过递归的方式进行遍历
5. AC代码
class Solution {
public List<Integer> preorder(Node root) {
List<Integer> ret = new ArrayList<Integer>();
if(root == null) return ret;
preOrder(root,ret);
return ret;
}
private void preOrder(Node root, List<Integer> ret) {
if(root == null) return;
ret.add(root.val);
for (Node children: root.children) {
if(children != null)
preOrder(children,ret);
}
}
}