package trees;

public class Leaf<K extends Comparable<K>, V> implements INode<K, V> {
	public V search(K key) {
		return null;
	}

	public INode<K, V> insert(K key, V value) { // returns the new root
		return new BinaryNode<K, V>(key, value);
	}

	public String toString()
	{
		return "Leaf";
	}
}