/**      * Returns the value associated with the given key in this symbol table.      * Takes advantage of the fact that the keys appear in increasing order to terminate      * early when possible.      *      * @param  key the key      * @return the value associated with the given key if the key is in the symbol table      *     and {@code null} if the key is not in the symbol table      * @throws IllegalArgumentException if {@code key} is {@code null}      */     public Value get(Key key) {         // TODO         // Change this code to make use of the fact the list is sorted to terminate early         // when possible.  Also, solve this using recursion.  To do this, you will need to         // add a recursive helper function that takes the front of a list (Node) as an argument         // and returns the correct value.         if (key == null) throw new IllegalArgumentException("argument to get() is null");          for (Node x = first; x != null; x = x.next) {             if (key.equals(x.key))                 return x.val;         }         return null;     } You may not use the keys() method in your code. You are modifying the implementation of the  methods, but not their interface or contract. Please use the nodes instead of "left" and "right".

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

/**
     * Returns the value associated with the given key in this symbol table.
     * Takes advantage of the fact that the keys appear in increasing order to terminate
     * early when possible.
     *
     * @param  key the key
     * @return the value associated with the given key if the key is in the symbol table
     *     and {@code null} if the key is not in the symbol table
     * @throws IllegalArgumentException if {@code key} is {@code null}
     */
    public Value get(Key key) {
        // TODO
        // Change this code to make use of the fact the list is sorted to terminate early
        // when possible.  Also, solve this using recursion.  To do this, you will need to
        // add a recursive helper function that takes the front of a list (Node) as an argument
        // and returns the correct value.
        if (key == null) throw new IllegalArgumentException("argument to get() is null"); 
        for (Node x = first; x != null; x = x.next) {
            if (key.equals(x.key))
                return x.val;
        }
        return null;
    }

You may not use the keys() method in your code. You are modifying the implementation of the 
methods, but not their interface or contract. Please use the nodes instead of "left" and "right".

Expert Solution
steps

Step by step

Solved in 4 steps with 5 images

Blurred answer
Knowledge Booster
Linux
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education