Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Create an ordered linked list in java: As for the style and documentation, please don't return or break from inside a loop. Also, please add
Create an ordered linked list in java:
As for the style and documentation, please don't return or break from inside a loop. Also, please add lots of comments so that I know what you're doing.
Package name should be "assign6"
ui class name File to submit: Ordered LinkedList.java OrderedLinkedList list: node - count: int + OrderedLinkedList0 + numEntries0: int + insert (int): void + delete (int): void* + toString0: String + get(int): int * Throws exception Required methods 1. OrderedList 0 2. numEntries0:int 3. insert (int): void a. create an empty linked list of integers a. return the number of integers currently stored in the list a. b. insert an integer into the list so that the elements are in ascending order do not allow for duplicates in the array 4. delete (int): void find the integer in the list and remove it if the value is not in the array, throw an exception with the string containing the number that could not be deleted and the message Delete not successful" if the value is in the array, remove it so that the elements remain in ascending order a. b. c. 5. toString0: String return the values in the array so that all values are separated by a space the string should be 1 2 3" not" 1 2 3 an empty list should return an empty string (0 characters) a. b, c. 6. get(int): int a. b. find the integer in the list at the position indicated and return it if the value is not in the list, throw an exception with the string containing the number of the position and the message "Get not successful" the position of the nodes starts at 0, not 1 cStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started