10000 Added Code for Single Linked List by HIMU-2001 · Pull Request #440 · aaryahjolia/dsa_competitive-coding · GitHub
[go: up one dir, main page]
Skip to content

Added Code for Single Linked List #440

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Added Code for Single Linked List #440

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
175 changes: 175 additions & 0 deletions Linked List/Single_Linked_List.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,175 @@
// C++ program for the above approach
#include <iostream>
using namespace std;

// Node class to represent
// a node of the linked list.
class Node {
public:
int data;
Node* next;

// Default constructor
Node()
{
data = 0;
next = NULL;
}

// Parameterised Constructor
Node(int data)
{
this->data = data;
this->next = NULL;
}
};

// Linked list class to
// implement a linked list.
class Linkedlist {
Node* head;

public:
// Default constructor
Linkedlist() { head = NULL; }

// Function to insert a
// node at the end of the
// linked list.
void insertNode(int);

// Function to print the
// linked list.
void printList();

// Function to delete the
// node at given position
void deleteNode(int);
};

// Function to delete the
// node at given position
void Linkedlist::deleteNode(int nodeOffset)
{
Node *temp1 = head, *temp2 = NULL;
int ListLen = 0;

if (head == NULL) {
cout << "List empty." << endl;
return;
}

// Find length of the linked-list.
while (temp1 != NULL) {
temp1 = temp1->next;
ListLen++;
}

// Check if the position to be
// deleted is greater than the length
// of the linked list.
if (ListLen < nodeOffset) {
cout << "Index out of range"
<< endl;
return;
}

// Declare temp1
temp1 = head;

// Deleting the head.
if (nodeOffset == 1) {

// Update head
head = head->next;
delete temp1;
return;
}

// Traverse the list to
// find the node to be deleted.
while (nodeOffset-- > 1) {

// Update temp2
temp2 = temp1;

// Update temp1
temp1 = temp1->next;
}

// Change the next pointer
// of the previous node.
temp2->next = temp1->next;

// Delete the node
delete temp1;
}

// Function to insert a new node.
void Linkedlist::insertNode(int data)
{
// Create the new Node.
Node* newNode = new Node(data);

// Assign to head
if (head == NULL) {
head = newNode;
return;
}

// Traverse till end of list
Node* temp = head;
while (temp->next != NULL) {

// Update temp
temp = temp->next;
}

// Insert at the last.
temp->next = newNode;
}

// Function to print the
// nodes of the linked list.
void Linkedlist::printList()
{
Node* temp = head;

// Check for empty list.
if (head == NULL) {
cout << "List empty" << endl;
return;
}

// Traverse the list.
while (temp != NULL) {
cout << temp->data << " ";
temp = temp->next;
}
}

// Driver Code
int main()
{
Linkedlist list;

// Inserting nodes
list.insertNode(1);
list.insertNode(2);
list.insertNode(3);
list.insertNode(4);

cout << "Elements of the list are: ";

// Print the list
list.printList();
cout << endl;

// Delete node at position 2.
list.deleteNode(2);

cout << "Elements of the list are: ";
list.printList();
cout << endl;
return 0;
}
0