二叉树非递归遍历实现

先序遍历

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import javax.swing.tree.TreeNode;
import java.util.ArrayList;
import java.util.Stack;

public class Main{
    public ArrayList<Integer> preorderTraversal(TreeNode root) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        if(root == null)
            return list;

        Stack<TreeNode> stack = new Stack<TreeNode>();
        TreeNode node = root;
        while(node != null || !stack.isEmpty()) {
            while(node != null) {
                stack.push(node);
                list.add(node.val);
                node = node.left;
            }
            node = stack.pop();
            node = node.right;
        }

        return list;
    }
}

中序遍历

import javax.swing.tree.TreeNode;
import java.util.ArrayList;
import java.util.Stack;

public class Main{
    public ArrayList<Integer> inorderTraversal(TreeNode root) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        if(root == null)
            return list;

        Stack<TreeNode> stack = new Stack<TreeNode>();
        TreeNode node = root;
        while(node != null || !stack.isEmpty()) {
            while(node != null) {
                stack.push(node);
                node = node.left;
            }
            node = stack.pop();
            list.add(node.val);
            node = node.right;
        }
        
        return list;
    }
}

后序遍历

import javax.swing.tree.TreeNode;
import java.util.ArrayList;
import java.util.Stack;

public class Main{
    public ArrayList<Integer> postorderTraversal(TreeNode root) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        if(root == null)
            return list;

        Stack<TreeNode> stack = new Stack<TreeNode>();
        stack.push(root);
        TreeNode pre = null; //前一个访问的节点

        while( !stack.isEmpty()){
            TreeNode node = stack.peek();
            //当是叶节点或其子节点都被访问时
            if((node.left == null && node.right == null) ||
                    (pre != null && (pre == node.left || pre == node.right))){
                list.add(node.val);
                stack.pop();
                pre = node;
            }else{
                if(node.right != null)
                    stack.push(node.right);
                if(node.left != null)
                    stack.push(node.left);
            }
        }

        return list;
    }
}