0590-NAryTreePostorderTraversal.cs

//-----------------------------------------------------------------------------
// Runtime: 280ms
// Memory Usage: 34.2 MB
// Link: https://leetcode.com/submissions/detail/328756714/
//-----------------------------------------------------------------------------

using System.Collections.Generic;

namespace LeetCode
{
    /*
    // Definition for a Node.
    public class Node {
        public int val;
        public IList<Node> children;
    
        public Node() {}
    
        public Node(int _val) {
            val = _val;
        }
    
        public Node(int _val, IList<Node> _children) {
            val = _val;
            children = _children;
        }
    }
    */

    public class _0590_NAryTreePostorderTraversal
    {
        public IList<int> Postorder(Node root)
        {
            var result = new List<int>();
            if (root == null) return result;

            var stack = new Stack<Node>();
            stack.Push(root);
            while (stack.Count > 0)
            {
                var node = stack.Pop();
                result.Add(node.val);
                if (node.children != null)
                    foreach (var child in node.children)
                        stack.Push(child);
            }

            result.Reverse();
            return result;
        }

        public class Node
        {
            public int val;
            public IList<Node> children;

            public Node() { }

            public Node(int _val)
            {
                val = _val;
            }

            public Node(int _val, IList<Node> _children)
            {
                val = _val;
                children = _children;
            }
        }
    }
}