bst inorder.java

/**
 * Definition for binary tree
 * 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> res = new ArrayList<Integer>();
        if (root == null)
            return res;
        TreeNode curr = root;
        Stack<TreeNode> path = new Stack<TreeNode>();
        while (!path.isEmpty() || curr != null) {
            while (curr != null) {
                path.push(curr);
                curr = curr.left;
            }
            curr = path.pop();
            res.add(curr.val);
            curr = curr.right;
        }
        return res;
    }
}