Scribd
Upload
13 views4 pages

Singly Linked List

The document discusses operations on singly linked lists including inserting nodes at the head, tail, or any position in the list, deleting nodes, traversing the list to print out elements, and searching for a node with a given data value. It includes functions and sample code to demonstrate each operation.

Uploaded by

mehedi.ratul111
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views4 pages

Singly Linked List

The document discusses operations on singly linked lists including inserting nodes at the head, tail, or any position in the list, deleting nodes, traversing the list to print out elements, and searching for a node with a given data value. It includes functions and sample code to demonstrate each operation.

Uploaded by

mehedi.ratul111
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Singly Linked List

#include<iostream>
using namespace std;
struct Node
{
int data;
Node* next;

};
Node* head;

Node* GetNewNode(int x)
{
Node* NewNode = new Node();
NewNode->data = x;
NewNode->next = NULL;
return NewNode;
}

void InsertAtHead(int x)
{
Node* NewNode = GetNewNode(x);
NewNode->next = head;
head = NewNode;

void InserAtTail(int x)
{
Node* NewNode = GetNewNode(x);
if (head == NULL)
{
head = NewNode;
return;
}
Node* temp = head;
while (temp->next != NULL)
{
temp = temp->next;
}
temp->next = NewNode;

void InserAtAnyPosition(int n, int x)


{
Node* NewNode = GetNewNode(x);
if (n == 1)
{
NewNode->next = head;
head = NewNode;
return;
}
Node* temp = head;
for (int i = 1; i < n - 1; i++)
{
temp = temp->next;
}

NewNode->next = temp->next;
temp->next = NewNode;

void Delete(int n)
{

if (head == NULL)
{
cout << "Error: Nothing to delete " << endl;
return;
}
Node* temp = head;
if (n == 1)
{
head = temp->next;
delete temp;
return;
}
for (int i = 1; i < n - 1; i++)
{
temp = temp->next;
}
Node* temp2 = temp->next;
temp->next = temp2->next;
delete temp2;
return;
}
void DeleteTail()
{
Node* temp = head;
Node* temp2 = temp;
int i = 0;
while (temp->next != NULL)
{
if (i > 0)
{
temp2 = temp2->next;
}
temp = temp->next;
++i;
}
temp2->next = NULL;
delete temp;

}
void Traverse()
{
Node* temp = head;
cout << "List is: ";
while (temp != NULL)
{
cout << temp->data << " ";
temp = temp->next;

}
cout << endl;
}

void Search(int x)
{
Node* temp = head;
while (temp != NULL)
{
if (temp->data == x)
{
cout << "Found" << endl;
return;
}
temp = temp->next;

}
cout << "Not found" << endl;
}

int main()
{
head = NULL;
InsertAtHead(5);
InsertAtHead(6);
InsertAtHead(7);
InsertAtHead(8);
Traverse();

InserAtTail(9);
InserAtTail(10);
Traverse();

InserAtAnyPosition(2, 11);
Traverse();
Delete(5);
Traverse();
Search(10);
Search(100);
Delete(1);
Traverse();
DeleteTail();
Traverse();
}
Output:
List is: 8 7 6 5
List is: 8 7 6 5 9 10
List is: 8 11 7 6 5 9 10
List is: 8 11 7 6 9 10
Found
Not found
List is: 11 7 6 9 10
List is: 11 7 6 9

You might also like