![Solution
import java.util.Scanner; class BinarySearchExample { public static void main(String args[]) {
int counter, num, item, array[], first, last, middle; //To capture user input Scanner input = new
Scanner(System.in); System.out.println("Enter number of elements:"); num = input.nextInt();
//Creating array to store the all the numbers array = new int[num]; System.out.println("Enter "
+ num + " integers"); //Loop to store each numbers in array for (counter = 0; counter < num;
counter++) array[counter] = input.nextInt(); System.out.println("Enter the search value:"); item
= input.nextInt(); first = 0; last = num - 1; middle = (first + last)/2; while( first <= last ) { if (
array[middle] < item ) first = middle + 1; else if ( array[middle] == item ) {
System.out.println(item + " found at location " + (middle + 1) + "."); break; } else { last =
middle - 1; } middle = (first + last)/2; } if ( first > last ) System.out.println(item + " is not
found. "); } }](https://image.slidesharecdn.com/java-designadatastructureintsetthatcanholdasetofintegers-230209170354-4f805642/85/JAVA-Design-a-data-structure-IntSet-that-can-hold-a-set-of-integers-docx-2-320.jpg)
JAVA - Design a data structure IntSet that can hold a set of integers-.docx
- 1. JAVA - Design a data structure IntSet that can hold a set of integers. Hide the private implementation: a Binary Search Tree of Integer objects. Provide the following public methods only. • Constructor to make an empty set, • Constructor to create a set by initializing the root, • void add(int x) to add x if it is not present, • void remove(int x) to remove x if it is present, • void print() to print all the elements currently in the set, • boolean contains(int x) to test whether x is present, • IntSet copy() to create a new BTS as a copy of the current one. Note that the root of the BST is a private data member and there is no need to define getRoot(), and setRoot() functions. All the above functions should be defined public and should call recursive private functions to do the task. e.g. // remove private Node recRemove(Node loc, int x) { // To do } public void remove(int x) { root= recRemove(root, x) ; } // contains private boolean recContains(Node loc, int x) { // to do } public boolean contains(int x) { return recContains(root, x) ; } Complete the class IntSet by supplying the intersection and union functions. Use the same format as above i.e. each public function calls a private recursive function to do the task: public IntSet union(IntSet other) public IntSet intersection(IntSet other)
- 2. Solution import java.util.Scanner; class BinarySearchExample { public static void main(String args[]) { int counter, num, item, array[], first, last, middle; //To capture user input Scanner input = new Scanner(System.in); System.out.println("Enter number of elements:"); num = input.nextInt(); //Creating array to store the all the numbers array = new int[num]; System.out.println("Enter " + num + " integers"); //Loop to store each numbers in array for (counter = 0; counter < num; counter++) array[counter] = input.nextInt(); System.out.println("Enter the search value:"); item = input.nextInt(); first = 0; last = num - 1; middle = (first + last)/2; while( first <= last ) { if ( array[middle] < item ) first = middle + 1; else if ( array[middle] == item ) { System.out.println(item + " found at location " + (middle + 1) + "."); break; } else { last = middle - 1; } middle = (first + last)/2; } if ( first > last ) System.out.println(item + " is not found. "); } }