class BST {

private Node root;

//Basic Node definition. Each Node contains a Value, a left child, and a right child
class Node {

   int val;
   Node left, right;

   public Node(int value) {
         val = value;
         left = null;
         right = null;
   }
}

public BST() {
   root = null;
}

public BST(int rootValue) {
   root = new Node(rootValue);
}

public void insert(int value) {
   root = insert(root, value);
}

//insert Value into the appropriate spot in the tree
private Node insert(Node n, int value) {

   if (n == null) {
         n = new Node(value);
         return n;
   }

   if (value < n.val) {
         n.left = insert(n.left, value);
   } else if (value > n.val) {
         n.right = insert(n.right, value);
   }

   return n;
}

public static void main(String[] args) {
   //create tree with a root of 5
   BST tree = new BST(5);

   tree.insert(2);
   tree.insert(7);
   tree.insert(10);
   tree.insert(4);
   tree.insert(1);

   //start traversal at root
   tree.inorderTraversal();
   System.out.println("------------------");
   tree.preorderTraversal();
   System.out.println("------------------");
   tree.postorderTraversal();

   System.out.println("------------------");

   System.out.println(tree.search(5));
   System.out.println(tree.search(50));

}

/**
* Lab 7 : traversal and search
*/
public void preorderTraversal() {
   preorderTraversal(root);
}

Implement a class Boat. The Boat class defines three fields (i.e. a...