Consider a Linked List with each Node, in addition to having a 'next'
pointer also has a 'random' pointer. The 'random' pointer points to
some random other Node on the linked list. It may also point to NULL. To
simplify things, no two 'random' pointers will point to the same node,
but more than 1 Node's random pointer can point to NULL.
Now we are required to reverse the direction of all the pointers (both the 'next' and 'random') of the Linked list. The constraint is the solution MUST be O(1) space complexity (A constant number of new nodes can be created but not proportional to the length of the list)
Now we are required to reverse the direction of all the pointers (both the 'next' and 'random') of the Linked list. The constraint is the solution MUST be O(1) space complexity (A constant number of new nodes can be created but not proportional to the length of the list)
Solution :
Please refer to the following link for suitable answer :
http://stackoverflow.com/
http://stackoverflow.com/
No comments:
Post a Comment