1 /*
 2  * BinaryTreeADT.java of trees package
 3  */
 4 package trees;
 5 
 6 /**
 7  * ADT for a basic binary tree
 8  * @author notebook
 9  */
10 public interface BinaryTreeADT<K,V> {
11     public V value();
12     public void setValue(V value);
13     public boolean empty();
14     public int height();
15     public void preorder();
16     public void inorder();
17     public void postorder();
18     public void addLR(K key, V value, String dir) throws BinaryTreeCreationException;
19     public void addND(K key, V value);
20     public void addST(K key, V value) throws BinaryTreeCreationException;
21     public V get(K key);
22     public BinaryTree<K,V> find(K key);
23     public boolean member(K key);
24     public void visit();
25     public void sprout(K key, V value);
26     
27 }
28