package btree;

/** javadoc comments describing the BSTree class should go here */
public class BSTree <T extends Comparable<T>> extends BTree<T> {
	/* fields */

	/* constructors */

	public BSTree() {
		root = null;
	}

	public BSTree(int i) {  
		// BSTree(-1) constructs a 3 node "demo" tree
		if(i==-1) {
			root = new BNode<Integer>();
			root.data = new Integer(5);
		
			BNode<Integer> lnode = new BNode<Integer>();
			lnode.data = new Integer(2);
		
			BNode<Integer> rnode = new BNode<Integer>();
			rnode.data = new Integer(8);
		
			root.left = lnode;
			root.right = rnode;
		}
		// BSTree(-2) constructs a 6 node "demo" tree
		if(i==-2) {
			root = new BNode<Integer>(new Integer(12));
			root.left = new BNode<Integer>(new Integer(6));
			root.right = new BNode<Integer>(new Integer(50));
			root.right.left = new BNode<Integer>(new Integer(27));
			root.right.left.left = new BNode<Integer>(new Integer(13));
			root.right.left.right = new BNode<Integer>(new Integer(41));
		}
	}


	/* methods */
	
	/** Insert javadoc comments here to describe this method */ 
	public boolean insert(T item) {
		return false;
	}
	
	/** Insert javadoc comments here to describe this method */ 
	public boolean delete(T item) {
		return false;
	}
	
	/** Insert javadoc comments here to describe this method */ 
	public T find (T item) {
		return null;
	}
	

}