Linked List ADT Given Node class, below is an example of implementation for some

Question

Linked List ADT
Given Node class, below is an example of implementation for some linked list operations...
class Node
data-type data
Node next
Node(data-type val)
data = val
next = null/None
// implement get and set methods for data and next
class LinkedList
Node head
Node tail
LinkedList()
Assign null/None to head and tail
addHead(data-type val)
Node n = Node(val)
if (head == null/None) // no elements
head = n
tail = n
else // have elements
set n.next to head
head =n
addTail(data-type val)
Node n = Node(val)
if (head == null/None) // no elements
head = n
tail = n
else // have elements
set tail.next to n
tail =n

Explanation / Answer

You have not mentioned the programming language. Assuming it is Java

LinkedList.java
-------

public class LinkedList<T> {
class Node{
T data;
Node next;

Node(T val){
data = val;
next = null;
}
}

Node head, tail;

public LinkedList(){
head = null;
tail = null;
}

public void addHead(T val){
Node n = new Node(val);
if(head == null){
head = n;
tail = n;
}
else {
n.next = head;
head = n;
}
}

public void addTail(T val){
Node n = new Node(val);
if(head == null){
head = n;
tail = n;
}
else {
tail.next = n;
tail = n;
}
}
}

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.