More Problems

• Write a function to merge two sorted circular doubly linked lists where one list contains prime values and the other contains composite values.
• How do you detect and remove all loops in a multilevel circular singly linked list where nodes may have random pointers?
• Implement a function to reverse the first n nodes in a circular doubly linked list while leaving the rest of the list unchanged.
• Write a function to rearrange nodes in a circular doubly linked list such that all even-positioned nodes come before odd-positioned nodes.
• How do you split a doubly linked list into two lists where one list 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 at the front.
• Write a function to flatten a multilevel doubly linked list where each node may contain both forward and child pointers.
• How do you merge k unsorted doubly linked lists into one sorted circular singly linked list using merge sort?