[Random Coding] Tree Iterator

最新推荐文章于 2022-04-09 15:10:00 发布

原创最新推荐文章于 2022-04-09 15:10:00 发布 · 591 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个简单的二叉树迭代器实现方法，通过该迭代器可以按顺序遍历二叉树的所有节点。文章详细解释了如何使用左子树进行初始化，并在每次调用next()方法时找到下一个节点。

package RandomPractice;

import java.util.NoSuchElementException;
import util.*;

public class TreeIterator {
	private BTNode next;
	public TreeIterator(BTNode root){
		next = root;
		if(next == null)
			return;
		while(next.left != null)
			next = next.left;
	}
	public boolean hasNext(){
		return next != null;
	}
	public BTNode next(){
		if(!hasNext())
			throw new NoSuchElementException();
		BTNode result = next;
		if(next.right != null){
			next = next.right;
			while(next.left != null)
				next = next.left;
		} else{
			while(true){
				if(next.parent == null){
					next = null;
					break;
				} 
				if(next.parent.left == next){
					next = next.parent;
					break;
				}
				next = next.parent;
			}
		}
		return result;
	}
	public static void main(String[] args){
		BTNode root = new BTNode(4);
		root.left = new BTNode(2);
		root.right = new BTNode(5);
		root.left.parent = root;
		root.right.parent = root;
		root.left.left = new BTNode(1);
		root.left.right = new BTNode(3);
		root.left.left.parent = root.left;
		root.left.right.parent = root.left;
		TreeIterator it = new TreeIterator(root);
		while(it.hasNext())
			System.out.println(it.next().value);
	}
}