Ques:- Sort the linklist by node whose alternate nodes are already sorted
Asked In :-
Evergent Technologies, neudesic,
Right Answer:
To sort a linked list where alternate nodes are already sorted, follow these steps:
1. Split the linked list into two separate lists: one for the nodes at even indices and another for the nodes at odd indices.
2. Sort each of these two lists individually.
3. Merge the two sorted lists back together by alternating nodes from each list.
Here’s a simple implementation in Python:
```python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def sort_alternate_linked_list(head):
if not head or not head.next:
return head
# Split the list into two lists
even_head = even_tail = head
odd_head = odd_tail = head.next
current = head.next.next
index = 0
while current:
if index % 2 == 0:
even_tail.next = current
even_tail = even_tail.next
else:
To sort a linked list where alternate nodes are already sorted, follow these steps:
1. Split the linked list into two separate lists: one for the nodes at even indices and another for the nodes at odd indices.
2. Sort each of these two lists individually.
3. Merge the two sorted lists back together by alternating nodes from each list.
Here’s a simple implementation in Python:
```python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def sort_alternate_linked_list(head):
if not head or not head.next:
return head
# Split the list into two lists
even_head = even_tail = head
odd_head = odd_tail = head.next
current = head.next.next
index = 0
while current:
if index % 2 == 0:
even_tail.next = current
even_tail = even_tail.next
else:
