N-ary Tree Postorder Traversal at Amazon

Easy81.0% acceptance

This problem has 12.5% frequency at Amazon.

Problem Description

Given the `root` of an n-ary tree, return _the postorder traversal of its nodes ' values_. Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)

Read full problem and hints

Topics

Also asked at 2 companies


More Amazon Questions

View all Amazon questions