previous | start | next

The Node class for TrieST

The private Node class

private static class Node<V> 
{
  private V val;
  private final Node<V>[] next = new Node[R]; // e.g. R = 256
}


previous | start | next