Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes’ values.

Example :

Given binary tree

   1
    \
     2
    /
   3

return [3,2,1].

Using recursion is not allowed.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Postorder Traversal on Interview Code Editor
Sign Up
to access hints and editorial solutions for Postorder Traversal
7955 successful submissions.
Asked In:
  • Amazon
  • Microsoft
Click here to start solving coding interview questions