JAVA_N-ary Tree Preorder Traversal_LeetCode 589

JAVA_N-ary Tree Preorder Traversal_LeetCode 589 풀이 class Solution { List<Integer> arr = new ArrayList<>(); public List<Integer> preorder(Node root) { if (root == null) return arr; arr.add(root.val); for (Node child : root.children) preorder(child); return arr; } } * 출처 N-ary Tree Preorder Traversal - LeetCode N-ary Tree Preorder Traversal - Given the root of an n-ary tree, return the preorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level order traver...

원문링크 : JAVA_N-ary Tree Preorder Traversal_LeetCode 589