4. Object Oriented Programming: Implement a new method for the LinkedList class

Question

4. Object Oriented Programming: Implement a new method for the LinkedList class (lab 6). This method performs a swapping of the head and the tail nodes in a list where it has more than 1 element. The current position is required to swap if it is pointing to the head or tail node. The method does not require input argument(s). If the operation is performed successfully, the method will return a Boolean true value. Otherwise, it returns a false value. Provide the Java code for this method. Hint: For a starter, you might consider explaining your idea in a diagram accompanied with pseudo code (in English). Then finally translate this work into a Java method. Please use the back of this page as needed public boolean swapHeadAndTail)f

Explanation / Answer

Assuming it is a Single linked list:---------

public boolean swapHeadAndTail(){

Node tail=head,prev_tail=NULL;

while(tail.next!=NULL){

prev_tail=tail;

tail=tail.next;

}

if(head!=tail){

prev_tail.next=head;

tail.next=head.next;

head.next=NULL;

head=tail;

tail=prev_tail.next;

return true;

}

return false;

}

Related Questions

Navigate

• Browse (All)
• Browse 4
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.