JAVA_N-ary Tree Postorder Traversal_LeetCode 590

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

원문링크 : JAVA_N-ary Tree Postorder Traversal_LeetCode 590