Exercise 3 (List ADT – Removing Last Half) In the Lab7project, Modify the LinkedIntListclass to include a new method called removeLastHalf, which removes the last half of elements in the list. For example, if the list contains 2, 4, 7, 6, 5, 9, with 2 being at the front, then the method would modify the list so it contains only 2, 4, 7. Test your implementation in the main method. Also, state the time complexity of your method implementation.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Use java and properly indent the code.
Exercise 3 (List ADT – Removing Last Half)
In the Lab7project, Modify the LinkedIntListclass to include a new method called
removeLastHalf, which removes the last half of elements in the list. For example, if the list
contains 2, 4, 7, 6, 5, 9, with 2 being at the front, then the method would modify the list so it
contains only 2, 4, 7. Test your implementation in the main method. Also, state the time
complexity of your method implementation.
Transcribed Image Text:Exercise 3 (List ADT – Removing Last Half) In the Lab7project, Modify the LinkedIntListclass to include a new method called removeLastHalf, which removes the last half of elements in the list. For example, if the list contains 2, 4, 7, 6, 5, 9, with 2 being at the front, then the method would modify the list so it contains only 2, 4, 7. Test your implementation in the main method. Also, state the time complexity of your method implementation.
import java.io.*;
import java.util.LinkedList;
// Main class
public class GFG {
// Main driver method
public static void main (String args [])
{
// Creating an empty LinkedList of integer type
LinkedList list = new LinkedList ();
// Adding elements in the list
// Using add () method
list.add (10);
list.add (50);
list.add (90);
list.add (70);
list.add (96);
// Printing the elements inside LinkedList
System.out.println ("LinkedList:" + list);
// Removing the head from List
list.remove () ;
// Printing the final elements inside Linkedlist
System.out.println ("Final LinkedList:" + list);
Transcribed Image Text:import java.io.*; import java.util.LinkedList; // Main class public class GFG { // Main driver method public static void main (String args []) { // Creating an empty LinkedList of integer type LinkedList list = new LinkedList (); // Adding elements in the list // Using add () method list.add (10); list.add (50); list.add (90); list.add (70); list.add (96); // Printing the elements inside LinkedList System.out.println ("LinkedList:" + list); // Removing the head from List list.remove () ; // Printing the final elements inside Linkedlist System.out.println ("Final LinkedList:" + list);
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Threads in linked list
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education