In Java I did an insert method for my program, but I want to make sure its correct, please check it and fix if theres any errors the code public void insert(E key) throws DuplicateItemException { BSTNode child = new BSTNode(key); if ( root == null ) { root = child; } else { BSTNode parent = insertionPoint(key); } try { BSTNode parent = insertionPoint(key); if (key.compareTo(parent.getKey()) < 0){ parent.setLeftChild(child); } else if (key.compareTo(parent.getKey()) > 0) { parent.setRightChild(child); } } catch (DuplicateItemException ex) { throw ex; } }

In Java I did an insert method for my program, but I want to make sure its correct, please check it and fix if theres any errors the code public void insert(E key) throws DuplicateItemException { BSTNode child = new BSTNode(key); if ( root == null ) { root = child; } else { BSTNode parent = insertionPoint(key); } try { BSTNode parent = insertionPoint(key); if (key.compareTo(parent.getKey()) < 0){ parent.setLeftChild(child); } else if (key.compareTo(parent.getKey()) > 0) { parent.setRightChild(child); } } catch (DuplicateItemException ex) { throw ex; } }

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 8E

See similar textbooks

Similar questions

Hello The java function belw is generating a NullPointerException. How can I improve it? public int quadraticProbing(String[] hashArray, int initial_index, int collision) { int index = (initial_index + (collisions * collisions)) % maxSize; System.out.println("Index " + index); if (index == maxSize) { System.out.println("flag 04"); index = 0; // To wrap around the table } if (hashArray[index] == null) { return index; // We can insert at this location } else { // The index isn't empty so we need to insert the value // at the end of the list } collisions = ++collision; return quadraticProbing(hashArray, initial_index, collision); // Recursive call } Thanks in advance. Respectfully, Emmanuel
can you please fix the AssertionError in this and also the code: (please don't use try and except or break/continue or recursion) def hike_unique(m: list[list[int]], start_point: tuple[int, int],end_point: tuple[int, int]) -> int: if start_point == end_point:return 0else:front_row = start_point[0]front_column = start_point[1]end_row = end_point[0]end_column = end_point[1]front_eva = m[front_row][front_column]end_eva = m[end_row][end_column]eva_diff = abs(front_eva - end_eva)if front_row == end_row:total_cost = eva_diff * (abs(front_column - end_column)) + 1elif front_column == end_column:total_cost = eva_diff * (abs(front_row - end_row)) + 1else:total_cost = eva_diff * (abs(front_row - end_row) + abs(front_column - end_column)) - 1return total_cost print(hike_unique(sample_map, (1, 1), (0, 0)) It should print 3 if the sample_map is >>> sample_map = [[1, 3], ... [0, 4]] if you do…
I was provided with the following code. However, when executing it goes to an infite loop and cannot seem to ppass by that. public int compares(Card c1, Card c2){ // TODO: implement this method if(c1.getSuit() > c2.getSuit()) return 1; if(c1.getSuit() < c2.getSuit()) return -1; else { if(c1.getRank() > c2.getRank()) return 1; if (c1.getRank() < c2.getRank()) return -1; else return 0; } public void quickSortRec(Card[] cardArray, int first, int last) { if (first < last) { int splitPoint; splitPoint = split(cardArray, first, last); quickSortRec(cardArray, first, splitPoint); quickSortRec(cardArray, splitPoint + 1, last); }} public int split(Card[] cardArray, int first, int last){ Card splitValue = cardArray[first]; while(first <= last) { while(compares(cardArray[first],splitValue) == -1) { first++;…
Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10}, print: 7 9 11 10 10 11 9 7 import java.util.Scanner; public class CourseGradePrinter {public static void main (String [] args) {Scanner scnr = new Scanner(System.in);final int NUM_VALS = 4;int [] courseGrades = new int[NUM_VALS];int i; for (i = 0; i < courseGrades.length; ++i) {courseGrades[i] = scnr.nextInt();} /* Your solution goes here */ P.S. The answer came out wrong the first try 7 9 11 10 10 11 9 7Enter
Your tasks Implement the methods marked with ??? in percentiles.scala Please use scala to write code package percentiles: /** * Given a non-empty sequence of elements of type T, returns the smallest element e * in the sequence for which it holds that at least p percent of the elements in the sequence * are smaller or equal to e. * Note the special cases: * - when p == 0, the result should be the smallest element in the sequence * - when p == 100, the result should be the largest element in the sequence * If the sequence is empty, java.lang.IllegalArgumentException is thrown. * * For a sequence of length n, the method should make at most n*log(n) * [again, here log means base-2 logarithm] comparison operations between * the elements in the sequence. * Furthermore, assuming that comparison is a constant-time operation, * the whole method should run in O(n*log(n)) time. * Hint: you can assume that the "sorted" method of Seq performs at most…
Complete the method insertInMiddle.
I'm unable to use the method replaceAll because we have not touch upon it yet, so since the chapter cover loops, here are my 2 codes (Code 1) import java.util.Scanner; public class LabProgram {public static void main(String[] args) {/* Type your code here. */Scanner scnr = new Scanner(System.in);String str= scnr.next();String newStr=""; for (int i=0; i < str.length(); i++) {if (str.charAt(i) == '@')newStr+="";else if (str.charAt(i) == '1')newStr+="";else if (str.charAt(i) == '!')newStr+="";else if (str.charAt(i) == '-')newStr+="";else if (str.charAt(i) == '$')newStr+="";else if (str.charAt(i) == '.')newStr+="";else if (str.charAt(i) == ' ')newStr+="";else newStr= str.charAt(i);}System.out.println(newStr); }} (Code 2) It's the same as the 1st code but I removed the charAt(i) to newStr as in: newStr=str; System.out.println(newStr); This code displayed the string but no nonalpha characters were removed.
Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. Use the following files: Question.java /** A question with a text and an answer.*/public class Question{ private String text; private String answer; /** Constructs a question with empty text and empty answer. */ public Question() { text = ""; answer = ""; } /** Sets the answer for this question. @param correctResponse the answer */ public void setAnswer(String correctResponse) { answer = correctResponse; } /** Checks a given response for correctness. @param response the response to check @return true if the response was correct, false otherwise */ public boolean checkAnswer(String response) { return response.equals(answer); } /** Add a line of text to…
Write a program that benchmarks QuickSort and InsertionSort. You should use at least 5 different data sets and record the performance of each algorithm on the same sets under the same conditions. Write a short report that compares the two algorithms based your results. It is important to include a discussion of the initial states of the data sets in your report. language Java public class week3 {public static void main(String args[]){ //========================================================== //Question 1 testing //================== // Comment on benchmarking for Q1 results // // //========================================================== } static void quickSort(int f[], int p, int q){ if(q-p <= 1) ; //skip else{ int x; int i, j, k; // let x = middle element in f[p..q-1] x = f[(p+q)/2]; //x = f[p]; i = p; j = p; k = q; while(j != k){ if(f[j] == x) j = j + 1; else if(f[j] < x){ //swap f[j] with f[i] int temp; temp = f[j]; f[j] = f[i]; f[i] = temp; j = j + 1; i = i + 1; } else{…
Rewrite the following piece of java code using iterator pattern. And change the operation inside the for loop to another operation of your own. And What was the advantage of using the iterator ? import java.util.Iterator String[ ] originalData = { "one", "two", "three", "four", "five" }; List<String> strings = new ArrayList<>(Arrays.asList(originalData)); for ( int i=0; i<strings.size(); i++) { // process strings.get(i): here, just printSystem.out.println(strings.get(i));}
Write a method that computes the sum of the digitsin an integer. Use the following method header:public static int sumDigits(long n)For example, sumDigits(234) returns 9 (= 2 + 3 + 4). (Hint: Use the % operatorto extract digits and the / operator to remove the extracted digit. For instance,to extract 4 from 234, use 234 % 10 (= 4 ). To remove 4 from 234, use 234 / 10(= 2 3 ). Use a loop to repeatedly extract and remove the digit until all the digitsare extracted. Write a test program that prompts the user to enter an integer thendisplays the sum of all its digits.
Write a method (in C++), called PrintNumbers, that prints out the following sequence of numbers. The method must use a for-loop to print the outputs. HINT: “To get started: what’s the pattern from number X to (X+1)? Does it apply to the next pair of numbers?” 8 12 18 26 36 48 62