Preorder Traversal

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

Example :
Given binary tree


return [1,2,3].

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 Preorder Traversal on Interview Code Editor
Sign Up
to access hints and editorial solutions for Preorder Traversal
Asked In:
  • Amazon
  • Microsoft


Click here to start solving coding interview questions