More Problems

• Write a function to reverse every alternate k-th node in a multilevel circular doubly linked list without recursion.
• How do you split a circular singly linked list into two lists where one contains nodes with prime-numbered positions and the other contains composite-numbered positions?
• Implement a function to rotate a multilevel circular singly linked list such that nodes with prime values appear before nodes with composite values.
• Write a function to flatten a multilevel circular singly linked list where each node contains both next and child pointers.
• How do you detect the first common node in two linked lists where one list contains random pointers and the other list contains child pointers?
• Implement a function to reverse the first half of a circular doubly linked list while leaving the second half unchanged.
• Write a function to rearrange nodes in a circular singly linked list such that nodes with even values appear before odd values.
• How do you split a circular doubly linked list into two lists where one list contains nodes divisible by 3 and the other contains nodes divisible by 4?