Trie

```
public class Trie<K,V>
extends java.lang.Object
```
A trie, also called digital tree or prefix tree, is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string. Values are normally not associated with every node, only with leaves and some inner nodes that correspond to keys of interest.

Nested Classes
Modifier and Type	Class and Description
`class`	`Trie.Node` The nodes in the trie.

Constructors
Constructor and Description
`Trie()` Constructor.
`Trie(int initialCapacity)` Constructor.

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`Trie.Node`	`get(K key)` Returns the node of a given key.
`V`	`get(K[] key)` Returns the associated value of a given key.
`void`	`put(K[] key, V value)` Add a key with associated value to the trie.
`int`	`size()` Returns the number of entries.

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Class Trie<K,V>