public class TrieST<Value> {

  /*
   * Extendeed ASCII
   */
  private static int R = 256;

  /*
   * The root of the trie
   */
  private Node root;

  /*
   * The number of keys in this trie
   */
  private int size;

  /*
   * R-way trie node
   */
  private static class Node {
    private Object value;
    private Node[] next = new Node[R];
  }

   /**
    * Initializes an empty string symbol table.
    */
    public TrieST() { }

    public int size() {
      return 1;
    }
}

@@ -433,16 +433,99 @@
 () %7B %7D%0A%0A
+    /**%0A     * Returns the number of key-value pairs in this symbol table.%0A     */%0A
     publ
@@ -557,10 +557,24 @@
 urn 
-1;
+this.size;%0A    %7D
 %0A   

Add method to compute trie' size