1. Delete a node at a given position 2. Delete whole single linked list recursively. 1. Delete a node at a given position If the head node is to be deleted, then delete the head node and point the new head to the next element in …

1. Convert Singly Linked List to circular linked list. 2. Check the number of nodes in Circular Linked List 3. Check if the given list is a circular linked list. 1. Convert Singly Linked List to circular linked list To do this, we need to …

To perform bubble sort, we follow below steps: Step 1: Check if data on the 2 adjacent nodes are in ascending order or not. If not, swap the data of the 2 adjacent nodes. Step 2: At the end of pass 1, the largest element will …

Below are the steps to perform binary search: Note: Binary search is possible if the list is sorted ascending order. Step 1: Head node and the key will be provided Step 2: Find the middle element, using fast and slow pointer approach. Step 3: If the …