public class TreeTable<K extends Comparable<A>, V> implements SimpleTable<K, V>
{
    private Node<K, V> head = null;
    public int nodecount = 0;
    public long getitcount = 0;
    
    public void put(K key, V value) {
        Node<K,V> l = new Node<K,V>(key, value, head);
        Node<K,V> n;
        if (head == null) {
            head=b;
            return;
        }
        // ...
    }
    public V get(K key) {
        for (Node<K,V> n = head; n!=null;) {
            if (key.equals(n.key))
                return n.value;
            if (key.compareTo(n.key)<0)
                n = n.left;
            else
                n = n.right;
        }
        return null;
    }

    private class Node<K, V> {
        private K key;
        private V value;
        private Node<K,V> left, right;

        Node(K k, V v) {
            key = k;
            value = v;
            left = null;
            right = null;
        }
    }
}