package com.algorithms.tree;

public class BST<Key extends Comparable<Key>, Value> {

    private Node root;

    private class Node {
        private Key key;
        private Value val;
        private Node left, right;
        public Node(Key key, Value val) {
            this.key = key;
            this.val = val;
        }
    }

    public void put(Key key, Value val) {}

    public Value get(Key key) {}

    public void delete(Key key) {}

    public Iterable<Key> iterator() {}
}

@@ -396,32 +396,294 @@
 e get(Key key) %7B
+%0A        Node x = root;%0A%0A        while (x != null) %7B%0A            int cmp = key.compareTo(x.key);%0A            if      (cmp %3C 0) x = x.left;%0A            else if (cmp %3E 0) x = x.right;%0A            else              return x.val;%0A        %7D%0A%0A        return null;%0A    
 %7D%0A%0A    public vo

Implement get