LeetCode-N-ary Tree Postorder Traversal

Description: Given an n-ary tree, return the postorder traversal of its nodes’ values. For example, given a 3-ary tree: Return its postorder traversal as: [5,6,3,2,4,1]. Note: Recursive solution is tr
相关文章
相关标签/搜索