/*
 * tree_dictionary.cpp
 *
 *  Created on: 09.01.2013
 *      Author: trifon
 */

#include "AVLtree.cpp"
#include "dictionary.h"

template <typename K=int, typename V=int>
class TreeDictionary : public Dictionary<K, V>
{
private:
	AVLTree<K, V> d;
public:
	bool add(K const& key, V const& value)
	{
		return d.insert(key, value);
	}

	V* search(K const& key) const {
		return d.search(key);
	}

	bool remove(K const& key)
	{
		return d.remove(key);
	}

	void print() const {
		d.print();
	}

private:
	void collectKeys(BinTreeIterator<AVLNode<K, V> > it, LinkedList<K>& keys) const
	{
		if (it) {
			collectKeys(++it, keys);
			keys.toEnd((*it).key);
			collectKeys(it++, keys);
		}
	}

	void collectValues(BinTreeIterator<AVLNode<K, V> > it, LinkedList<V>& values) const
	{
		if (it) {
			collectValues(++it, values);
			values.toEnd((*it).value);
			collectValues(it++, values);
		}
	}

public:
	LinkedList<K> keys() const {
		LinkedList<K> k;
		collectKeys(d.iterator(), k);
		return k;
	}

	LinkedList<V> values() const {
		LinkedList<V> v;
		collectValues(d.iterator(), v);
		return v;
	}

};