94. 二叉树的中序遍历(非递归遍历)

思路

先将节点的所有左孩子加入栈中，当前节点的左孩子为空时，就将该节点弹出栈，并且cur指向当前节点，将cur的值加入到res中，然后cur指向该节点的右孩子。

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        if(root == null){
            return res;
        }
        Stack<TreeNode> stack = new Stack<TreeNode>();
        TreeNode cur = root;
        while( cur != null || !stack.empty()){
            if(cur != null){
                stack.push(cur);
                cur = cur.left;
            }else{ 
                cur = stack.pop();
                res.add(cur.val);
                cur = cur.right;
            }
            
        }
        return res;
    }
}