Question

Solve the following LinkedList problems. You can use the LinkedList class from the previous lab. Write the following methods for the LinkedList class Problem 1: Write a method that deletes the first half of the list. Problem 2: Write a method that deletes the second half of the list. Problem 3: Write a method that deletes every other element in the list. Problem 4: Write a method that, given a second LinkedList, creates and returns a third list containing all elements from the first two list. Problem 5: Write a method that, given a second LinkedL ist, creates and returns a third list containing only those elements that the first two lists have if common.

Answer 1

public void deleteHalf() {

if(this.head == null)

return;

int size = this.size();

int i=0;

Node temp = head;

while(i < size/2) {

temp = temp.link;

i++;

}

this.head = temp.link;

}

public void deleteSecondHalf() {

if(this.head == null)

return;

int size = this.size();

int i=0;

Node temp = head;

while(i < size/2) {

temp = temp.link;

i++;

}

temp.link = null;

}

public void deleteElement() {

this.head = null;

}

public LinkedList<E> allElements(LinkedList<E> list2) {

LinkedList<E> thirdList = new LinkedList<E>();

if(this.head == null && list2.head == null) {

thirdList = null;

}

if(list2.head == null) {

thirdList.head = this.head;

}

else if(this.head == null)

thirdList.head = list2.head;

else {

Node temp = this.head;

while(temp.link != null) {

temp = temp.link;

}

temp.link = list2.head;

thirdList.head = this.head;

}

return thirdList;

}