Link: https://leetcode.com/problems/n-ary-tree-postorder-traversal/
Solution:
Topics: DFS
Intuition
Trivial little problem. Just do a DFS and append the parent node value to the result after all children have been visited. Postorder is typically how DP problems are structured.
Implementation
Review 1
Too easy. Remember that post-order is after the recursion (children added before parents).