Write some Software

You will implement a container for integer values using a Binary Search Tree for the underlying data structure. The operations or features that your container will support are Data Management  insert (or add or put)  delete (or remove)  find (or lookup or get)  traversal (or show) I/O  generate (random number generation)  array input/output (conversion from/to array)  file input/output (read/write)  menu (for command-line interaction with user) -------------------------- code: ------------------------- interface IBST { public void insert(int v); public boolean delete(int v); public boolean find(int v); } class Node { public int data; public Node left, right; // other methods if you want … } class MyTree implements IBST { private Node root; public MyTree() {/* your code here */ } public MyTree(int[] x) { /* your code here */ } public void insert(int value) { /* your code here */ } public boolean delete(int value) { /* your code here */ } public boolean find(int value) { /* your code here */ } public int getHeight(boolean output) { /* your code here */ } public boolean confirm() { /* your code here */ } public String toString() { /* your code here */ } public String toString(String type) { /* your code here */ } public void show() { /* your code here */ } public void show(String type) { /* your code here */ } private String inOrder() { /* your code here */ } private String preOrder() { /* your code here */ } private String postOrder() { /* your code here */ } public void menu() { /* your code here */ } }