LeetCode 590. N-ary Tree Postorder Traversal

2022-06-27 06:00:15 阅读：121 来源： 互联网

标签：Node 590 val ary Tree res null root public

原题链接在这里：https://leetcode.com/problems/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. Each group of children is separated by the null value (See examples)

Example 1:

Input: root = [1,null,3,2,4,null,5,6]
Output: [5,6,3,2,4,1]

Example 2:

Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
Output: [2,6,14,11,7,3,12,8,4,13,9,10,5,1]

Constraints:

The number of nodes in the tree is in the range [0, 104].
0 <= Node.val <= 104
The height of the n-ary tree is less than or equal to 1000.

Follow up: Recursive solution is trivial, could you do it iteratively?

题解：

Could do it recursively.

Time Complexity: O(n). n is the number of numbers in the tree.

Space: O(logn).

AC Java:

 1 /*
 2 // Definition for a Node.
 3 class Node {
 4     public int val;
 5     public List<Node> children;
 6 
 7     public Node() {}
 8 
 9     public Node(int _val) {
10         val = _val;
11     }
12 
13     public Node(int _val, List<Node> _children) {
14         val = _val;
15         children = _children;
16     }
17 };
18 */
19 
20 class Solution {
21     public List<Integer> postorder(Node root) {
22         List<Integer> res = new ArrayList<>();
23         if(root == null){
24             return res;
25         }
26         
27         dfs(root, res);
28         return res;
29     }
30     
31     private void dfs(Node root, List<Integer> res){
32         if(root == null){
33             return;
34         }
35         
36         for(Node next : root.children){
37             dfs(next, res);
38         }
39         
40         res.add(root.val);
41     }
42 }

Could do it iteratively. It is like method 2 in Binary Tree Postorder Traversal.

Time Complexity: O(n).

Space: O(logn). stack space.

AC Java:

 1 /*
 2 // Definition for a Node.
 3 class Node {
 4     public int val;
 5     public List<Node> children;
 6 
 7     public Node() {}
 8 
 9     public Node(int _val) {
10         val = _val;
11     }
12 
13     public Node(int _val, List<Node> _children) {
14         val = _val;
15         children = _children;
16     }
17 };
18 */
19 
20 class Solution {
21     public List<Integer> postorder(Node root) {
22         List<Integer> res = new ArrayList<>();
23         if(root == null){
24             return res;
25         }
26         
27         Stack<Node> stk = new Stack<>();
28         stk.push(root);
29         while(!stk.isEmpty()){
30             Node cur = stk.pop();
31             res.add(cur.val);
32             for(Node next : cur.children){
33                 if(next != null){
34                     stk.push(next);
35                 }
36             }
37         }
38         
39         Collections.reverse(res);
40         return res;
41     }
42 }

类似N-ary Tree Preorder Traversal, Binary Tree Postorder Traversal.

标签：Node,590,val,ary,Tree,res,null,root,public
来源： https://www.cnblogs.com/Dylan-Java-NYC/p/16414940.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9

LeetCode 590. N-ary Tree Postorder Traversal