迭代法实现二叉树前序遍历,其思想是:从根节点开始,如果有左子树就一直往下找,每遍历一次就把结点放入栈里,直到为空。然后向上向右遍历:弹出栈顶元素,node切换为栈顶元素的右子树,如果有左子树就一直往下找,没有就继续弹栈:
public class IteratorTree {
public static void main(String[] args) {
Tree root = new Tree(3, null, null);
int[] values = {1, 2, 4, 17, 6, 11, 9, 49, 31};
root.initTree(root, values);
preOrder(root);
}
//迭代法实现前序遍历
public static void preOrder(Tree root) {
//使用栈辅助遍历
Deque<Tree> deque = new LinkedList();
if (root == null) {
return;
}
Tree node = root;
//判断,如果栈不为空,或者当前的结点不是null,那么继续遍历
while (deque.size() > 0 || node != null) {
while (node != null) {
//当前结点不为空,打印出结点的值,并入栈
System.out.println(node.data);
deque.add(node);
//一路往左子树深入,直到结点为空
node = node.leftTree;
}
//查看当前栈顶元素的右子树结点
node = deque.pop().rightTree;
}
}
}
class Tree {
int data;
Tree leftTree;
Tree rightTree;
public Tree(int data, Tree left, Tree right) {
this.data = data;
this.leftTree = left;
this.rightTree = right;
}
//树的初始化
public Tree initTree(Tree root, int[] values) {
for (int i = 0; i < values.length; i++) {
insert(root, values[i]);
}
return root;
}
public void insert(Tree root, int data) {
//比root大的元素放右子树,不然放左子树
if (data > root.data) {
if (root.rightTree == null) {
root.rightTree = new Tree(data, null, null);
} else {
this.insert(root.rightTree, data);
}
} else {
if (root.leftTree == null) {
root.leftTree = new Tree(data, null, null);
} else {
this.insert(root.leftTree, data);
}
}
}
}
这样理解起来可能还是有些困难,其实迭代的代码,本质上和下面这个递归的代码是一样的:
//递归法实现前序遍历
public static void preOrder(Tree root) {
if (root == null) {
return;
}
System.out.println(root.data);
preOrder(root.leftTree);
preOrder(root.rightTree);
}