Binary Search Tree

Step 1 : Create an interface for a Dictionary, include method for put, get, isEmpty, and keyIterator. Step 2: Create a binary search tree implementation for Dictionary Step 3: Create a test program to insure your program works. The program should use K key, and V value. There needs to be an iterator. Program must use recursion. Program needs to be used a linked list, with nodes, etc. YOU DO NOT HAVE TO MAKE REMOVE, OR DELETE METHODS.