package generischer_binaerbaum;

public class Leaf<E extends Comparable<E>> extends Node<E> {
	public Leaf(E elem) {
		super(elem);
	}

	@Override
	public Node<E> append(E e) {
		InnerNode<E> me = new InnerNode<>(elem, null, null);
		
		if (e.compareTo(elem) < 0) {
			me.left = new Leaf<>(e);
		} else {
			me.right = new Leaf<>(e);
		}
		
		return me;
	}

	@Override
	public boolean equals(Object o) {
		if (!(o instanceof Leaf))
				return false;
		
		Leaf<E> casted = (Leaf<E>) o;
		return elem.equals(casted.elem);
	}
	
}