[LeetCode] 590. N-ary Tree Postorder Traversal - Java

• 문제 링크

N-ary Tree Postorder Traversal - LeetCode

 

• 풀이 코드

import java.util.ArrayList;
import java.util.List;

public class Solution {

    List<Integer> list = new ArrayList<>();

    public List<Integer> postorder(Node root) {
        dfs(root);

        return list;
    }

    private void dfs(Node node) {
        if (node == null) return;

        for (Node child : node.children) dfs(child);
        list.add(node.val);
    }

}