More Problems

• Write a function to rotate a multilevel circular singly linked list such that every k-th node becomes the new head, preserving the structure of both child and sibling pointers.
• How do you merge two unsorted circular doubly linked lists into one sorted circular singly linked list using heapsort?
• Implement a function to reverse every second node in a circular singly linked list without recursion, while preserving the structure of the list.
• Write a function to flatten a multilevel circular singly linked list where each node contains both forward and backward pointers and random pointers.
• How do you rearrange nodes in a circular doubly linked list such that nodes with prime values come before composite values, while maintaining the structure?
• Implement a function to split a sorted singly linked list into two lists where one contains nodes with prime values and the other contains nodes divisible by 3.
• Write a function to reverse every alternate k-th node in a circular doubly linked list while preserving the relative order of sibling pointers.
• How do you detect and remove loops in a multilevel circular singly linked list where nodes have both next and child pointers?