Algorithm Function: …show more content…
} public static void main(String[] args) { BinaryTree testTree = new BinaryTree(); char input; int addValue, sValue; System.out.println("Beginning BST"); System.out.println("You will be prompted to enter an integer in the" + " Jeliot window to add to the Binary Search Tree. After" + " adding an integer, you will be prompted to enter a" + " character. If you are done adding integers, enter 'd'. If" + " you are not, enter any other character."); do{ System.out.println("Add an integer to the BST: "); addValue = Input.readInt(); testTree.insert(addValue);
System.out.println("Type 'd' if done: "); input = Input.readChar(); } while (input != 'd' && input !=