Day 1 Linked list

Friday, December 2, 2022 7:08 PM

Linked List:
class LinkedList {
class Node {
int data;
Node next;

Node(int d)
{
data = d;
next = null;
}
}
Void addNode(Node);
Node getNode(int);
}

Traversal of LL:
public void printList(Node head)
{
Node n = head;
while (n != null) {
System.out.print(n.data + " ");
n = n.next;
}
}
Add node at front :
public void push(int new_data)
{
Node new_node = new Node(new_data);
new_node.next = head;
head = new_node;
}
Insert after n nodes
public void insertAfter(Node prev_node, int new_data)
{
if (prev_node == null) {
System.out.println(
"The given previous node cannot be null");
return;
}
Node new_node = new Node(new_data);
new_node.next = prev_node.next;
prev_node.next = new_node;
}

Insert node at end

public void append(int new_data)

{
Node new_node = new Node(new_data);
if (head == null)
 {
head = new Node(new_data);
return;
}
new_node.next = null;
Node last = head;
while (last.next != null)
last = last.next;

/* 6. Change the next of last node */

last.next = new_node;
return;
}

Delete a node when value is given

void deleteNode(int key)
{
Node temp = head, prev = null;
if (temp != null && temp.data == key) {
head = temp.next; // Changed head
return;
 }
while (temp != null && temp.data != key) {
prev = temp;
temp = temp.next;
}

if (temp == null)
return;

prev.next = temp.next;
}

void deleteWithValue(int data){

if(head == null){
System.out.println("Linked List is empty");
return;
}
Node n = head;
if(n.data == data){
head = n.next;
return;
}else{
while(n.next !=null && n.next.data != data){
n= n.next;
}
if(n.next != null){
n.next = n.next.next;
}
}
}