Question: Complete the implementation of the methods in this SimpleLinkedList class. Must use the generics and do not use HashMap util. V remove(K key), V remove(int

Complete the implementation of the methods in this SimpleLinkedList class. Must use the generics and do not use HashMap util.

V remove(K key), V remove(int n), V lookup(K key), V remove(), size(), V get(int n), and Object[] toArray()

SimpleLinkedList.java

public class SimpleLinkedList implements List {

private Node head = null;

@Override

public boolean add(K key, V value) {

if (head == null) { // List is empty

Node nn = new Node(key, value);

head = nn;

} else {

Node node = head;

while (node.next != null) {

node = node.next;

}

node.next = new Node(key, value);

}

return true;

}

@Override

public V remove(K key) {

// TODO Auto-generated method stub

return null;

}

@Override

public V remove(int n) {

// TODO Auto-generated method stub

return null;

}

@Override

public V remove() {

// TODO Auto-generated method stub

return null;

}

@Override

public V lookup(K key) {

// TODO Auto-generated method stub

return null;

}

@Override

public int size() {

// TODO Auto-generated method stub

return 0;

}

@Override

public V get(int n) {

// TODO Auto-generated method stub

return null;

}

private class Node {

protected K key;

protected V value;

protected Node next;

Node(K k, V v) {

key = k;

value = v;

next = null;

}

}

@Override

public Object[] toArray() {

return null;

}

public void searchElement(V nodeValue) {

Node node = head;

while (node != null) {

if(node.value.equals(nodeValue)) {

System.out.println(" Found ! Name : " + node.key

+ " ID : " + node.value);

}else{

System.out.println("Value " + nodeValue + " not found");

}

node = node.next;

}

}

@Override

public String toString() {

StringBuilder sb = new StringBuilder();

Node node = head;

while (node != null) {

sb.append("(" + node.key + "," + node.value + ") -- ");

node = node.next;

}

return sb.toString();

}

}

public interface List {

//abstract methods

public abstract boolean add(K key,V value);

public abstract V remove(K key);

public abstract V remove(int n);

public abstract V remove();

public abstract V lookup(K key);

public abstract int size();

public abstract V get(int n);

public abstract Object[] toArray();

public abstract String toString();

}

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!