Write the JAVA method secondHalf that takes an LLNode head as a parameter and returns an LLNode reference named newHead. The method should return the reference of the middle node of the list. If the linked list has 2 middle nodes, return the reference of the second middle. 4 You may not use any arrays or copy the linked list to any sort of data structure.

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
public LLNode secondHalf(LLNode head) { }
public class LLNode<T>
{
protected
T info;
protected LLNode<T> link;
public LLNode (T info)
{
}
}
this.info info;
this.link
null;
=
public void setInfo(T info){this.info
public T getInfo(){return this.info; }
public void setLink (LLNode<T> link){this.link = link;}
public LLNode<T> getLink() {return this.link;}
= info; }
Transcribed Image Text:public class LLNode<T> { protected T info; protected LLNode<T> link; public LLNode (T info) { } } this.info info; this.link null; = public void setInfo(T info){this.info public T getInfo(){return this.info; } public void setLink (LLNode<T> link){this.link = link;} public LLNode<T> getLink() {return this.link;} = info; }
Given the LLNode class above,
Write the JAVA method secondHalf that takes an LLNode head as a parameter
and returns an LLNode reference named newHead.
The method should return the reference of the middle node of the list. If the linked
list has 2 middle nodes, return the reference of the second middle.
You may not use any arrays or copy the linked list to any sort of data structure.
4
head
Example(One middle node):
newHead
►
22
►
44
94
►
75
44
For the previous linked list, the middle node is the node that contains 44:
secondHalf(head); returns:
75
81
81
Transcribed Image Text:Given the LLNode class above, Write the JAVA method secondHalf that takes an LLNode head as a parameter and returns an LLNode reference named newHead. The method should return the reference of the middle node of the list. If the linked list has 2 middle nodes, return the reference of the second middle. You may not use any arrays or copy the linked list to any sort of data structure. 4 head Example(One middle node): newHead ► 22 ► 44 94 ► 75 44 For the previous linked list, the middle node is the node that contains 44: secondHalf(head); returns: 75 81 81
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Concept of Threads
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
  • SEE MORE 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