Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes' values.
Example
Given binary tree {1,#,2,3},
   1
    \
     2
    /
   3
return [1,3,2].
Note: Recursive solution is trivial, could you do it iteratively?

Login to see Answer and Coaching Session More interview questions