New java code for this as well as running program screenshot:

int cmp = Give nonrecursive implementations of get() and put() for BST. Partial solution: Here is an implementation of get(): public Value get(Key key) { Node x = root; while (x != null) { key.compareTo(x.key); if (cmp == 0) return x.val; else if (cmp 0) x = x.right; } return null; } The implementation of put() is more complicated because of the need to save a point- er to the parent node to link in the new node at the bottom. Also, you need a separate pass to check whether the key is already in the table because of the need to update the counts. Since there are many more searches than inserts in performance-critical imple- mentations, using this code for get() is justified; the corresponding change for put() might not be noticed