Complete this method for removing and returning the first element of a linked list. If the list is empty, return null. Lists.java 1 import java.util. Iterator; 2 import java.util.LinkedList; 3 4 public class Lists 5 { 6 7 8 9 10 11 12 } 13} Lists Tester.java 1 import java.util.LinkedList; 2 import java.util.Arrays; 3 7 8 4 public class Lists Tester 5 { 6 9 public static String removeFirst (LinkedList strings) { · 10 11 12 13 " 14 15 16 17 Iterator iter = strings. iterator(); String result = null; return result; 18 19 20 21 22 23 } public static void main(String[] args) { } LinkedList lst1 = new LinkedListo(Arrays.asList("Peter", "Paul", "Mary")); String resl Lists.removeFirst (lst1); System.out.println(res1); System.out.println("Expected: Peter"); System.out.println(lst1); System.out.println("Expected: [Paul, Mary]"); LinkedList 1st2 = new Linked List (Arrays.asList("A", "B", "C", "D", "E")); String res2 Lists.removeFirst (1st2); System.out.println(res2); System.out.println("Expected: A"); System.out.println(1st2); System.out.println("Expected: [B, C, D, E]");
Complete this method for removing and returning the first element of a linked list. If the list is empty, return null. Lists.java 1 import java.util. Iterator; 2 import java.util.LinkedList; 3 4 public class Lists 5 { 6 7 8 9 10 11 12 } 13} Lists Tester.java 1 import java.util.LinkedList; 2 import java.util.Arrays; 3 7 8 4 public class Lists Tester 5 { 6 9 public static String removeFirst (LinkedList strings) { · 10 11 12 13 " 14 15 16 17 Iterator iter = strings. iterator(); String result = null; return result; 18 19 20 21 22 23 } public static void main(String[] args) { } LinkedList lst1 = new LinkedListo(Arrays.asList("Peter", "Paul", "Mary")); String resl Lists.removeFirst (lst1); System.out.println(res1); System.out.println("Expected: Peter"); System.out.println(lst1); System.out.println("Expected: [Paul, Mary]"); LinkedList 1st2 = new Linked List (Arrays.asList("A", "B", "C", "D", "E")); String res2 Lists.removeFirst (1st2); System.out.println(res2); System.out.println("Expected: A"); System.out.println(1st2); System.out.println("Expected: [B, C, D, E]");
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
Java Code
![Complete this method for removing and returning the first element of a linked list. If the list is empty,
return null.
Lists.java
1 import java.util. Iterator;
2 import java.util.LinkedList;
3
4 public class Lists
5 {
6 public static String removeFirst (LinkedList<String> strings)
7
{
8
9
10
11
12
13}
Lists Tester.java
1 import java.util.LinkedList;
2 import java.util.Arrays;
3
4 public class ListsTester
5 {
6
7
8
9
· 10 11123
14
15
16
w18192812223
17
20
Iterator<String> iter = strings. iterator();
String result = null;
return result;
23}
public static void main(String[] args)
{
}
LinkedList<String> lst1
= new Linked List (Arrays.asList("Peter", "Paul", "Mary"));
String res1 = Lists.removeFirst (lst1);
System.out.println(res1);
System.out.println("Expected: Peter");
System.out.println(lst1);
System.out.println("Expected: [Paul, Mary]");
LinkedList<String> 1st2
= new Linked List(Arrays.asList("A", "B", "C", "D", "E"));
String res2 = Lists.removeFirst (lst2);
System.out.println(res2);
System.out.println("Expected: A");
System.out.println(lst2);
System.out.println("Expected:
[B, C, D, E]");](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1580620b-ec3d-48da-8d5f-e0e1d6dd1757%2F06e1eb18-a197-46cd-9c0d-eac65be1b87f%2Fp16ay6f_processed.png&w=3840&q=75)
Transcribed Image Text:Complete this method for removing and returning the first element of a linked list. If the list is empty,
return null.
Lists.java
1 import java.util. Iterator;
2 import java.util.LinkedList;
3
4 public class Lists
5 {
6 public static String removeFirst (LinkedList<String> strings)
7
{
8
9
10
11
12
13}
Lists Tester.java
1 import java.util.LinkedList;
2 import java.util.Arrays;
3
4 public class ListsTester
5 {
6
7
8
9
· 10 11123
14
15
16
w18192812223
17
20
Iterator<String> iter = strings. iterator();
String result = null;
return result;
23}
public static void main(String[] args)
{
}
LinkedList<String> lst1
= new Linked List (Arrays.asList("Peter", "Paul", "Mary"));
String res1 = Lists.removeFirst (lst1);
System.out.println(res1);
System.out.println("Expected: Peter");
System.out.println(lst1);
System.out.println("Expected: [Paul, Mary]");
LinkedList<String> 1st2
= new Linked List(Arrays.asList("A", "B", "C", "D", "E"));
String res2 = Lists.removeFirst (lst2);
System.out.println(res2);
System.out.println("Expected: A");
System.out.println(lst2);
System.out.println("Expected:
[B, C, D, E]");
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
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