// Binary Tree implementation
// Based somewhat off of https://opendsa-server.cs.vt.edu/ODSA/Books/Everything/html/BST.html
public class BT<E> {
    private BinNode<E> root; // Root of the BT

    // constructor
    public BT(){
        root = null;
    }

    public BT( BinNode<E> root){
        this.root = root;
    }

    // Reinitialize tree
    public void clear(){
        root = null;
    }

    public void setRoot( BinNode<E> root){
        this.root = root;
    }

    // "visit" a node by displaying it value
    private void visit( BinNode<E> root ){
        System.out.println( root.value() );
    }

    public void preOrderTraverse( ){
        System.out.println("Pre-order Traversal:");

    }

    public void inOrderTraverse( ){
        System.out.println("In-order Traversal:");

    }

    public void postOrderTraverse( ){
        System.out.println("Post-order Traversal:");

    }
}