public void remove(List<K> elements)
	{
		if(this.search(elements)==null) return;
		
		TrieNode<K,V> pile=root;
		TrieNode<K,V> parent=root;
		TrieNode<K,V> node=null;
		K key=null;
		K trieKey=null;
		int index=0;
		Iterator<K> iter=elements.iterator();
		while(iter.hasNext())
		{
			index++;
			key=(K) iter.next();
			node=parent.getChildren().get(key);
			if(node.getChildren().size()>1)
			{
				pile=node;
				trieKey=elements.get(index);
			}
			parent=node;
		}
		
		pile.getChildren().get(trieKey).getChildren().clear();
		pile.getChildren().remove(trieKey);
		
	}