is lab with the code listed below. The LinkedList class defines the rudiments of the code needed to build a linked list of Nodes. Complete the code for the removeFirst method, which should remove and return the first element in the linked list. Throw a NoSuchElementException if the method is invoked on an empty list. Use the LinkedListRunner class’s main method to test your code. import java.util.NoSuchElementException; public class LinkedList {    private Node first;    public LinkedList() { first = null; }    public Object getFirst()    {

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...
icon
Related questions
Question

Start this lab with the code listed below. The LinkedList class defines the rudiments of the code needed to build a linked list of Nodes. Complete the code for the removeFirst method, which should remove and return the first element in the linked list. Throw a NoSuchElementException if the method is invoked on an empty list. Use the LinkedListRunner class’s main method to test your code.

import java.util.NoSuchElementException;

public class LinkedList
{
   private Node first;

   public LinkedList() { first = null; }

   public Object getFirst()
   {
      if (first == null) { throw new NoSuchElementException(); }  
      return first.data;
   }

   public void addFirst(Object element)
   {
       Node aNode = new Node();
       aNode.data = element;
       aNode.next = first;
       first = aNode;
      
   }

   public Object removeFirst()
   {
      // put your code here
   }

   public String toString()
   {
      String temp = "";
      Node current = first;
      while (current != null)
      {
         temp = temp + current.data.toString() + '\n';
         current = current.next;
      }
      return temp;
   }

   class Node
   {
      public Object data;
      public Node next;
   }
}

-----------------------------------

public class LinkedListRunner
{
   public static void main(String[] args)
   {
       LinkedList myList = new LinkedList();
       myList.addFirst("aaa");
       myList.addFirst("bbb");
       myList.addFirst("ccc");
       myList.addFirst("ddd");
       System.out.println(myList);
       System.out.println("Removed element:  " + myList.removeFirst());
       System.out.println("Removed element:  " + myList.removeFirst());
       System.out.println(myList);
   }
}

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY