二叉树的前中后序遍历统一迭代解法

前序遍历：

leetcode q144:https://leetcode-cn.com/problems/binary-tree-preorder-traversal/

#递归法：

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        preorder(root, res);
        return res;
    }

    void preorder(TreeNode root, List res){
        if(root == null)return;
        res.add(root.val);
        preorder(root.left, res);
        preorder(root.right, res);
    }
}

#迭代法：

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        while(!stack.isEmpty() || root != null){
            while(root != null){
                res.add(root.val);
                stack.push(root);
                root = root.left;
            }
            root = stack.pop();
            root = root.right;
        }
        
        return res;
    }
}

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        if(root != null)stack.push(root);
        while(!stack.isEmpty()){
            root = stack.pop();
            res.add(root.val);
            if(root.right != null)stack.push(root.right);
            if(root.left != null)stack.push(root.left);
        }
        
        return res;
    }
}

后序遍历

leetcode q145:https://leetcode-cn.com/problems/binary-tree-postorder-traversal/

#递归法：

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        postorder(root, res);
        return res;
    }

    void postorder(TreeNode root, List res){
        if(root == null)return;
        preorder(root.left, res);
        preorder(root.right, res);
        res.add(root.val);
    }
}

#迭代法：

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<Integer>();
        if (root == null) {
            return res;
        }

        Deque<TreeNode> stack = new LinkedList<TreeNode>();
        TreeNode prev = null;
        while (root != null || !stack.isEmpty()) {
            while (root != null) {
                stack.push(root);
                root = root.left;
            }
            root = stack.pop();
            if (root.right == null || root.right == prev) {
                res.add(root.val);
                prev = root;
                root = null;
            } else {
                stack.push(root);
                root = root.right;
            }
        }
        return res;
    }
}

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        LinkedList<Integer> res = new LinkedList<>();
        Stack<TreeNode> stack = new Stack<>();
        if(root != null)stack.push(root);
        while(!stack.isEmpty()){
            root = stack.pop();
            res.addFirst(root.val);
            if(root.left != null)stack.push(root.left);
            if(root.right != null)stack.push(root.right);
        }
        
        return res;
    }
}

中序遍历

leetcode q94:https://leetcode-cn.com/problems/binary-tree-inorder-traversal/

#递归法：

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        inorder(root, res);
        return res;
    }

    void inorder(TreeNode root, List res){
        if(root == null)return;
        inorder(root.left, res);
        res.add(root.val);
        inorder(root.right, res);
    }
}

#迭代法：

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        Stack<TreeNode> stack = new Stack<>();
        List<Integer> res = new ArrayList<>();
        while(!stack.empty()||root!=null){
            while(root!=null){
                stack.push(root);
                root = root.left;
            }
            root = stack.pop();
            res.add(root.val);
            root = root.right;
        }
        return res;
    }
}

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        Stack<TreeNode> stack = new Stack<>();
        List<Integer> res = new ArrayList<>();
        while(!stack.empty()||root!=null){
            if(root!=null){
                stack.push(root);
                root = root.left;
            }else{
	            root = stack.pop();
	            res.add(root.val);
	            root = root.right;
	        }
        }
        return res;
    }
}

在迭代法中，前中后序遍历套路都不太一样，下面是统一写法的迭代法：
#前序遍历：

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        if(root != null)stack.push(root);

        while(!stack.isEmpty()){
            root = stack.peek();
            if(root != null){
                root = stack.pop();

                if(root.right != null)stack.push(root.right);

                if(root.left != null)stack.push(root.left);

                stack.push(root);
                stack.push(null);
            }else{
                stack.pop();

                root = stack.pop();
                res.add(root.val);
            }
        }
        
        return res;
    }
}

#中序遍历

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        if(root != null)stack.push(root);

        while(!stack.isEmpty()){
            root = stack.peek();
            if(root != null){
                stack.pop();
                if(root.right != null)stack.push(root.right); //右

                stack.push(root); //根
                stack.push(null);

                if(root.left != null)stack.push(root.left); //左
            }else{
                stack.pop(); //弹出空节点
                root = stack.pop();
                res.add(root.val);
            }
        }

        return res;
    }
}

#后序遍历

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        if(root != null)stack.push(root);

        while(!stack.isEmpty()){
            root = stack.peek();
            if(root != null){
                root = stack.pop();

                stack.push(root);
                stack.push(null);

                if(root.right != null)stack.push(root.right);

                if(root.left != null)stack.push(root.left);
            }else{
                stack.pop();

                root = stack.pop();
                res.add(root.val);
            }
        }
        
        return res;
    }
}

题解：https://leetcode-cn.com/problems/binary-tree-postorder-traversal/solution/bang-ni-dui-er-cha-shu-bu-zai-mi-mang-che-di-chi-t/