Leetcode 590. N-ary Tree Postorder Traversal

Return the postorder traversal of an n-ary tree (visit all a node’s children left-to-right before the node itself). Recursive is straightforward; the follow-up asks for an iterative stack-based solution.