Given a binary tree, return the inorder traversal of its nodes' values.
Given binary tree [1,null,2,3],
\ 2 /
Note: Recursive solution is trivial, could you do it iteratively?
If you have different approach in mind or have any suggestion for this implementation feel free to share in the comment below. Thanks!