package browser;

public class BinaryTree<E> {

	private E data;
	private BinaryTree<E> right = null;
	private BinaryTree<E> left = null;
	private BinaryTree<E> father = null;

	public BinaryTree(E data, BinaryTree<E> left, BinaryTree<E> right) {
		if (left != null && left.father != null || right != null
				&& right.father != null)
			throw new IllegalArgumentException();
		this.data = data;
		this.left = left;
		this.right = right;
		left.father = right.father = this;
	}
	
	public Iterator<E> prefixeDFS() {
		return new Iterator<E>() {
			
		}
	}
}
