public V search(List<K> elements) {
		TrieNode<K,V> parent=root;
		Iterator<K> iter=elements.iterator();
		TrieNode<K,V> node=null;
		K key=null;
		while(iter.hasNext())
		{
			key=(K) iter.next();
			node=parent.getChildren().get(key);
			if(node == null)
			{
				return null;
			}
			parent=node;
			
		}	
		return parent.getValue();
	}