We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
NodeReverse(Nodehead){if(head==null||head.next==null){returnhead;}Nodetop=Reverse(head.next);head.next.next=head;//Remove the below line if you are looking to reverse a singly linked list. Simple :)head.prev=head.next;head.next=null;returntop;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Reverse a doubly linked list
You are viewing a single comment's thread. Return to all comments →
Another way (Using Recursion):