1) int minValue(Node n) // finds the min value in the BST

implement it first iteratively and then recursively

2) boolean contains(Node n, int val) // true if val is contained in this tree/BST, false otherwise

implement it first iteratively and then recursively

3) void insert(Node n, int val) // insert val into this BST (n is not null)

4) preorder, inorder, postorder print your tree (good way to verify your insert actually works)

5) int height(Node n) // return the height of this tree (number of levels)