TST (algorithms 4.0.1 API)

```
public class TST<Value>
extends Object
```
Compilation: javac TST.java Execution: java TST < words.txt Dependencies: StdIn.java Symbol table with string keys, implemented using a ternary search trie (TST). % java TST < shellsST.txt by 4 sea 6 sells 1 she 0 shells 3 shore 7 the 5 % java TST theory the now is the time for all good men Remarks -------- - can't use a key that is the empty string ""

Constructors
Constructor and Description
`TST()`

Methods
Modifier and Type	Method and Description
`boolean`	`contains(String key)` Is string key in the symbol table?
`Value`	`get(String key)`
`Iterable<String>`	`keys()`
`String`	`longestPrefixOf(String s)` Find and return longest prefix of s in TST
`static void`	`main(String[] args)`
`Iterable<String>`	`prefixMatch(String prefix)`
`void`	`put(String s, Value val)` Insert string s into the symbol table.
`int`	`size()`
`Iterable<String>`	`wildcardMatch(String pat)`

contains
```
public boolean contains(String key)
```
Is string key in the symbol table?

public void put(String s,
       Value val)

Insert string s into the symbol table.

longestPrefixOf
```
public String longestPrefixOf(String s)
```
Find and return longest prefix of s in TST

public Iterable<String> prefixMatch(String prefix)

public Iterable<String> wildcardMatch(String pat)

public static void main(String[] args)

Class TST<Value>