二叉树的前、中、后序遍历模板 - 迭代版

前序遍历：

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

中序遍历

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

后序遍历

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