590. N-ary Tree Postorder Traversal

Love The Way You Lie 2022-03-26 06:42 176阅读 0赞

Given an n-ary tree, return the *postorder* traversal of its nodes' values.

For example, given a `3-ary` tree:

![format_png][]

Return its postorder traversal as: `[5,6,3,2,4,1]`.

**Note:**

Recursive solution is trivial, could you do it iteratively?

/*
    // Definition for a Node.
    class Node {
    public:
        int val;
        vector<Node*> children;
    
        Node() {}
    
        Node(int _val, vector<Node*> _children) {
            val = _val;
            children = _children;
        }
    };
    */
    class Solution {
    public:
        vector<int> postorder(Node* root) {
             vector<int> result;
          stack<Node*> stackNode;
         if(root == nullptr)
                return result;  
          stackNode.push(root);
          while(!stackNode.empty())
          {                            
              Node* temp = stackNode.top();
              stackNode.pop();
              result.push_back(temp->val);
              for(int i = 0 ; i < temp->children.size(); i++)
              {
                stackNode.push(temp->children[i]);
              }
          }
          reverse(result.begin(), result.end());
          return result;
        }
    };

[format_png]: /images/20220326/ff84aabbe6814aa4a8a0cf8173a0f5b1.png

发表评论取消回复

表情：

评论列表（有 0 条评论，176人围观）

还没有评论，来说两句吧...

相关阅读

相关 LeetCode - Medium - 145. Binary Tree Postorder Traversal

Topic Stack, Tree Description [https://leetcode.com/problems/binary-tree-postorde

川长思鸟来/ 2022年12月27日 12:41/ 0 赞/ 139 阅读

相关 LeetCode - Easy - 590. N-ary Tree Postorder Traversal

Topic Tree Description [https://leetcode.com/problems/n-ary-tree-postorder-tra

墨蓝/ 2022年10月06日 01:57/ 0 赞/ 110 阅读

相关 leetCode解题报告之Binary Tree Postorder Traversal

题目： Binary Tree Postorder Traversal Given a binary tree, return the postorder tra

川长思鸟来/ 2022年08月25日 15:57/ 0 赞/ 61 阅读

相关 LeetCode145-Binary-Tree-Postorder-Traversal

LeetCode 145 : Binary Tree Postorder Traversal Given a binary tree, return the postord

本是古典何须时尚/ 2022年08月04日 12:49/ 0 赞/ 24 阅读

相关 leetcode 145. Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values. For example:

﹏ヽ暗。殇╰゛Y/ 2022年07月27日 15:55/ 0 赞/ 161 阅读

相关 LeetCode145—Binary Tree Postorder Traversal

原题 [原题链接][Link 1] > Given a binary tree, return the postorder traversal of its nodes

叁歲伎倆/ 2022年07月16日 04:22/ 0 赞/ 139 阅读

相关 68. Binary Tree Postorder Traversal

68. Binary Tree Postorder Traversal Description Given a binary tree, return th

叁歲伎倆/ 2022年05月27日 04:55/ 0 赞/ 174 阅读

相关 106. Construct Binary Tree from Inorder and Postorder Traversal

Given inorder and postorder traversal of a tree, construct the binary tree. Note: You

秒速五厘米/ 2022年05月12日 15:16/ 0 赞/ 202 阅读

相关 145. Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values. Example:

小鱼儿/ 2022年05月04日 01:58/ 0 赞/ 142 阅读

相关 590. N-ary Tree Postorder Traversal

Given an n-ary tree, return the postorder traversal of its nodes' values. For example,

Love The Way You Lie/ 2022年03月26日 06:42/ 0 赞/ 177 阅读