Leetcode no. 94

94. Binary Tree Inorder Traversal

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

For example:
Given binary tree [1,null,2,3],

   1
    \
     2
    /
   3

return [1,3,2].

Note: Recursive solution is trivial, could you do it iteratively?

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> list= new LinkedList<>();
            Stack<TreeNode> stack= new Stack<>();
            while (root!=null || !stack.isEmpty()){
                while (root!=null){
                    stack.push(root);
                    root= root.left;
                }
                if (!stack.isEmpty()){
                    TreeNode t= stack.pop();
                    list.add(t.val);
                    root= t.right;
                }
            }
            return list;
    }
}