Lecture 136:- LL Class - 2

Certainly! Let's continue exploring Linked Lists and delve into more advanced concepts and operations.

1. Insertion at End: To insert a node at the end of a linked list, you need to traverse the list until you reach the last node, then update the last node's next pointer to point to the new node.

cppCopy code

void insertAtEnd(int value) { Node* newNode = new Node(value); if (head == nullptr) { head = newNode; return; } Node* current = head; while (current->next != nullptr) { current = current->next; } current->next = newNode; }

2. Deletion: To delete a node from a linked list, you need to adjust the next pointers of the previous node to skip the node to be deleted.

cppCopy code

void deleteNode(int value) { if (head == nullptr) { return; } if (head->data == value) { Node* temp = head; head = head->next; delete temp; return; } Node* current = head; while (current->next != nullptr && current->next->data != value) { current = current->next; } if (current->next != nullptr) { Node* temp = current->next; current->next = current->next->next; delete temp; } }

3. Searching: To search for a specific value in a linked list, you need to traverse the list and compare the data of each node with the target value.

cppCopy code

bool search(int value) { Node* current = head; while (current != nullptr) { if (current->data == value) { return true; } current = current->next; } return false; }

4. Reversing a Linked List: To reverse a linked list, you need to adjust the next pointers to reverse the direction of the links between nodes.

cppCopy code

void reverse() { Node* prev = nullptr; Node* current = head; Node* next = nullptr; while (current != nullptr) { next = current->next; current->next = prev; prev = current; current = next; } head = prev; }

These are just a few more advanced operations you can perform on a linked list. Linked lists are the building blocks for more complex data structures like stacks, queues, and hash tables, and they are widely used in various algorithms. Understanding the operations on linked lists is essential for developing strong programming and problem-solving skills.