Lecture 137:- LL Class - 3 

Certainly! Let's continue exploring Linked Lists and cover a few more advanced topics and techniques.

1. Recursive Operations: You can perform various operations on a linked list using recursion, such as printing the list in reverse order or recursively reversing the list.

cppCopy code

void printReverse(Node* current) { if (current == nullptr) { return; } printReverse(current->next); std::cout << current->data << " "; }

2. Detecting and Removing Loops: In a linked list, a loop occurs when a node's next pointer points to a node that is already visited in the same traversal. You can use Floyd's Cycle Detection Algorithm (also known as the "tortoise and hare" algorithm) to detect and remove loops.

cppCopy code

bool detectLoop() { Node* slow = head; Node* fast = head; while (fast != nullptr && fast->next != nullptr) { slow = slow->next; fast = fast->next->next; if (slow == fast) { return true; // Loop detected } } return false; // No loop }

3. Merging Two Sorted Lists: Given two sorted linked lists, you can merge them into a single sorted linked list.

cppCopy code

Node* mergeSortedLists(Node* list1, Node* list2) { if (list1 == nullptr) { return list2; } if (list2 == nullptr) { return list1; } Node* result; if (list1->data <= list2->data) { result = list1; result->next = mergeSortedLists(list1->next, list2); } else { result = list2; result->next = mergeSortedLists(list1, list2->next); } return result; }

4. Counting Nodes: You can count the number of nodes in a linked list by traversing through it and incrementing a counter.

cppCopy code

int countNodes(Node* current) { int count = 0; while (current != nullptr) { count++; current = current->next; } return count; }

These are a few more advanced topics related to linked lists. Linked lists provide a foundation for understanding more complex data structures and algorithms. By mastering these concepts, you'll gain valuable problem-solving skills that are applicable to a wide range of programming scenarios.