Question

ASSIGNMENT INFO POD 40: Cut! (LinkedList Element Removal) - Week 12.4 / 1. POD: Cut! 5 points possible Reset to Starter Code Unsaved Changes POD 40: Cut! (Linked List Element Removal) - Week 12.4 Due in ld 3h Instructions Start Here Instructions Question 1 Unsaved Changes Coding Problem, 5 points possible Today you are going to be revisiting our team roster once again. Much of the linked list has already been implemented, including a constructor and append method. You will have to implement a new remove method which removes the specified element from the list. The following are details of the new remove method. All other input/output and processing of PoD.java are handled for you. Review & Submit O questions remaining Details Input The remove method takes in an object from the linked list as input. Processing Complete the remove method in the LinkedList class. Details of this are provided in the Java file at left. Output The remove method returns void. Output in PoD.java is taken care of for you. If the person whose name is being checked against the team roster is on the list (i.e. contained in the linked list), it is removed from the list and PoD.java outputs the team after removal. Sample Input Sample Output Barney Stinson Ted Mosby Robin Scherbatsky Lily Aldrin Marshall Eriksen Stella Zinman Stella Zinman FINAL TEAM: Barney Stinson Ted Mosby Robin Scherbatsky Lily Aldrin Marshall Eriksen Rur v Grading 41 LinkedList.Java* POD.Java* 1 Full Screen New <Collapse Sidebar

//LinkedList

import java.util.Scanner;

public class PoD

{

  

public static void main( String [] args )

{

Scanner in = new Scanner( System.in );

LinkedList teamList = new LinkedList();

final int TEAM_SIZE = Integer.valueOf(in.nextLine());

for (int i=0; i<TEAM_SIZE; i++)

{

String newTeamMember = in.nextLine();

teamList.append(newTeamMember);

}

while (in.hasNext())

{

String removeMember = in.nextLine();

teamList.remove(removeMember);

}

  

System.out.println("FINAL TEAM:");

System.out.println(teamList);

in.close();

System.out.print("END OF OUTPUT");

}

}

===========================================================================================

//PoD

import java.util.NoSuchElementException;

/**

* A listnked list is a sequence of nodes with efficient element

* insertion and removal. This class contains a subset of the methods

* of the standard java.util.LinkedList class.

*

* You will finish off the contains method.

*/

public class LinkedList

{

//attributes

private Node head;

private Node tail;

//Node

class Node

{

public Object data;

public Node previous;

public Node next;

}

/**

* Constructs an empty linked list/

*/

public LinkedList()

{

head = null;

tail = null;

}

/**

* @method removeHead()

* @param Object : object to be removed

* @returns void

*

* Removes node from the linked list

*/

public void remove(Object data)

{

//PLEASE START WORK HERE

//===============================================

//===============================================

//PLEASE END WORK HERE

}

/**

* Appends a new node to the end of the linked list.

*/

public void append(Object element)

{

if (head == null) //Empty linked list

{

Node firstNode = new Node();

firstNode.data = element;

firstNode.previous = null;

firstNode.next = null;

head = firstNode;

tail = firstNode;

}

else //At least one node already exists.

{

Node newNode = new Node();

newNode.data = element;

newNode.previous = tail;

newNode.next = null;

tail.next = newNode;

tail = newNode;

}

}

public String toString()

{

Node position = head;

String output = "";

while (position != null)

{

output += position.data + "\n";

position = position.next;

}

return output;

}

}

Answer 1

LinkedList.java Code:

  package doublyLinkedListRemove; public class LinkedList {      // attributes   private Node head;      private Node tail;      // Node         class Node      {               public Object data;             public Node previous;           public Node next;       }       /**      *       * Constructs an empty linked list/      *       */     public LinkedList()     {               head = null;            tail = null;    }       /**      *       *       *       * @param Object : object to be removed          *       * @returns void         *       *       *       * Removes node from the linked list     *       */     public void remove(Object data)         {               //start traversing from start node              //till find the data            Node current=head;              while(current!=null && !(current.data.equals(data)))            {                       current=current.next;           }               if(current!=null)//if data found at current node                {                       removeNode(current);//remove that particular node from list             }       }       //Utility method to remove a particular node    private void removeNode(Node node)      {                // Change previous only if node to be deleted // is NOT the first node                 if(node.previous!=null)                 {                       node.previous.next=node.next;           }               //if node is head change the head to its next node              else            {                       head=node.next;                 }               // Change next only if node to be deleted // is NOT the last node               if(node.next!=null)             {                       node.next.previous=node.previous;               }               //if node is tail change the tail to its previous node          else            {                       tail=node.previous;             }       }                       /**      *       * Appends a new node to the end of the linked list.     *       */     public void append(Object element)      {               if (head == null) // Empty linked list          {                       Node firstNode = new Node();                    firstNode.data = element;                       firstNode.previous = null;                      firstNode.next = null;                  head = firstNode;                       tail = firstNode;               }               else // At least one node already exists.               {                       Node newNode = new Node();                      newNode.data = element;                         newNode.previous = tail;                        newNode.next = null;                    tail.next = newNode;                    tail = newNode;                 }       }       public String toString()        {               Node position = head;           String output = "";             while (position != null)                {                       output += position.data + "\n";                         position = position.next;               }               return output;  } } 

ToD.java Code:

 package doublyLinkedListRemove; import java.util.Scanner; public class PoD {        public static void main(String[] args)  {                                               Scanner in = new Scanner( System.in );          LinkedList teamList = new LinkedList();                 final int TEAM_SIZE = Integer.valueOf(in.nextLine());           for (int i=0; i<TEAM_SIZE; i++)              {                       String newTeamMember = in.nextLine();                           teamList.append(newTeamMember);                 }               while (in.hasNext())            {                       String removeMember = in.nextLine();                            teamList.remove(removeMember);          }                                       System.out.println("FINAL TEAM:");                              System.out.println(teamList);                           in.close();                             System.out.print("END OF OUTPUT");      } } 

Sample Input:

6
Baryney Stinson
Ted Mosby
Robin Scherbatsky
Lily Aldrin
Marshall Eriksen
Stella Zinman
Stella Zinman

Sample Output:

FINAL TEAM:
Baryney Stinson
Ted Mosby
Robin Scherbatsky
Lily Aldrin
Marshall Eriksen

END OF OUTPUT

Image Of remove method:

540 public void remove(Object data) //start traversing from start node //till find the data Node current=head; while(current !=null && !(current.data.equals(data))) current=current.next; 9888328 if(current!=null)//if data found at current node removeNode(current);//remove that particular node from list //Utility method to remove a particular node private void removeNode (Node node) 710 // Change previous only if node to be deleted // is NOT the first node if(node.previous!=null) node.previous.next=node.next; //if node is head change the head to its next node else head=node.next; // Change next only if node to be deleted // is NOT the last node if(node.next!=null) node.next.previous=node.previous; //if node is tail change the tail to its previous node else tail=node.previous;

Input/Output Image:

6 Baryney Stinson Ted Mosby Robin Scherbatsky Lily Aldrin Marshall Eriksen Stella Zinman Stella Zinman FINAL TEAM: Baryney Stinson Ted Mosby Robin Scherbatsky Lily Aldrin Marshall Eriksen END OF OUTPUT