n_ary_tree_postorder_traversal

README

< Previous 　　　　　　　　　　　　　　　　 Next >

590. N-ary Tree Postorder Traversal (Easy)

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 trivial, could you do it iteratively?

Related Topics

[Tree]

Similar Questions

1. Binary Tree Postorder Traversal (Hard)
2. N-ary Tree Level Order Traversal (Easy)
3. N-ary Tree Preorder Traversal (Easy)