package exercise2;

import java.util.Iterator;

public class MapBinarySearchTree<K extends Comparable<K>, V> implements Map<K, V> {
	LinkedBinarySearchTree<KeyValuePair> tree = new LinkedBinarySearchTree<KeyValuePair>();

	@Override
	public V get(K k) {
		return null;
	}

	@Override
	public V put(K k, V v) {
		KeyValuePair kvp = new KeyValuePair(k, v);
		tree.insert(kvp);
		return v;
	}

	@Override
	public V remove(K k) {

		return null;
	}

	@Override
	public Iterator<K> keys() {
		return null;
	}

	@Override
	public Iterator<V> values() {
		// TODO Auto-generated method stub
		return null;
	}

	@Override
	public int size() {
		return tree.size();
	}

	@Override
	public boolean isEmpty() {
		return tree.isEmpty();
	}

	private class KeyValuePair<E> implements Comparable<E> {
		private K key;
		private V value;

		public KeyValuePair(K key, V value) {
			this.key = key;
			this.value = value;
		}

		public void setValue(V value) {
			this.value = value;
		}

		public K getKey(){
			return key;
		}

		public V getValue(){
			return value;
		}

		@Override
		public int compareTo(E o) {
			// TODO Auto-generated method stub
			return 0;
		}
	}
}