write code in JAVA /* You have to use the following template to submit to Revel. Note: To test the code using the CheckExerciseTool, you will submit entire code. To submit your code to Revel, you must only submit the code enclosed between // BEGIN REVEL SUBMISSION // END REVEL SUBMISSION // BEGIN REVEL SUBMISSION /** Add an element to the beginning of the list */ public void addFirst(E e) { // Write your code here } /** Add an element to the end of the list */ public void addLast(E e) { // Write your code here } /** * Add a new element at the specified index in this list The index of the *head element is 0 */ public void add(int index, E e) { // Write your code here } /** * Remove the head node and return the object that is contained in the * removed node. */ public E removeFirst() { // Write your code here } /** * Remove the last node and return the object that is contained in the * removed node. */ public E removeLast() { // Write your code here } /** * Remove the element at the specified position in this list. Return the * element that was removed from the list. */ public E remove(int index) { // Write your code here } } // END REVEL SUBMISSION
write code in JAVA /* You have to use the following template to submit to Revel. Note: To test the code using the CheckExerciseTool, you will submit entire code. To submit your code to Revel, you must only submit the code enclosed between // BEGIN REVEL SUBMISSION // END REVEL SUBMISSION // BEGIN REVEL SUBMISSION /** Add an element to the beginning of the list */ public void addFirst(E e) { // Write your code here } /** Add an element to the end of the list */ public void addLast(E e) { // Write your code here } /** * Add a new element at the specified index in this list The index of the *head element is 0 */ public void add(int index, E e) { // Write your code here } /** * Remove the head node and return the object that is contained in the * removed node. */ public E removeFirst() { // Write your code here } /** * Remove the last node and return the object that is contained in the * removed node. */ public E removeLast() { // Write your code here } /** * Remove the element at the specified position in this list. Return the * element that was removed from the list. */ public E remove(int index) { // Write your code here } } // END REVEL SUBMISSION
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
write code in JAVA
/* You have to use the following template to submit to Revel. Note: To test the code using the CheckExerciseTool, you will submit entire code. To submit your code to Revel, you must only submit the code enclosed between // BEGIN REVEL SUBMISSION // END REVEL SUBMISSION
// BEGIN REVEL SUBMISSION
/** Add an element to the beginning of the list */
public void addFirst(E e) {
// Write your code here
}
/** Add an element to the end of the list */
public void addLast(E e) {
// Write your code here
}
/** * Add a new element at the specified index in this list The index of the
*head element is 0
*/
public void add(int index, E e) {
// Write your code here
}
/**
* Remove the head node and return the object that is contained in the
* removed node.
*/
public E removeFirst() {
// Write your code here
}
/**
* Remove the last node and return the object that is contained in the
* removed node.
*/
public E removeLast() {
// Write your code here
}
/**
* Remove the element at the specified position in this list. Return the
* element that was removed from the list.
*/
public E remove(int index) {
// Write your code here
}
}
// END REVEL SUBMISSION
Transcribed Image Text:(Implement a doubly linked list)
The MyLinked List class used in LiveExample 24.5 is a one-way directional linked list that enables
one-way traversal of the list. Modify the Node class to add the new data field name previous to
refer to the previous node in the list, as follows:
public class Node {
E element;
Node next;
Node previous;
public Node (E e) {
element = e;
}
}
Implement a new class named TwoWayLinkedList that uses a doubly linked list to store elements.
Define TwowayLinkedList to implements MyList. You need to implement all the methods defined
in MyLinkedList as well as the methods listIterator() and listIterator(int index). Both
return an instance of java.util.ListIterator (see Figure 20.4). The former sets the cursor to
the head of the list and the latter to the element at the specified index.
Class Name: Exercise24_03
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY