Inorder Traversal

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

Example :
Given binary tree

   1
    \
     2
    /
   3

return [1,3,2].

Using recursion is not allowed.

Interview Code Editor
Hints
  • Solution Approach
  • Complete Solution
6109 successful submissions.
Asked In:
  • Amazon
  • Microsoft
Click here to jump start your coding interview preparation