1 /*
 2  *This is the interface for Binary Tree ADT
 3  */
 4 
 5 /**
 6  * Abstract Data Type for binary trees
 7  */
 8 package trees;
 9 
10 /**
11  *
12  * @author sjenks
13  */
14 public interface BinaryTreeADT<K, V> {
15 public V value();
16 public void setValue (V value);
17 public boolean empty();
18 public int height();
19 public void preorder();
20 public void inorder();
21 public void postorder();
22 public void addLR(K key, V value, String dir) throws BinaryTreeCreationException;
23 public void addND( K key, V value);
24 public void addST(K key, V value) throws BinaryTreeCreationException; 
25 public V get (K key);
26 public BinaryTree<K,V> find (K key);
27 public boolean member (K key);
28 public void visit();
29 public void sprout (K key, V value);
30 
31 }