1 1 vote Can we reverse a linked list in less than O(n) time?? Data Structures linked-list + – G Shaheena 609 views answer comment Share Follow Print See 1 comment 1 1 comment reply Warlock lord commented Aug 27, 2017 reply Follow flag Reversing a singly linked list in less than O(n)? No Doubly linked list? Yes. All you have to do is swap the head and tail reference. That's all. Since it is doubly linked we don't have to deal with switching the directions of the references. 3 3 replyShare Please log in or register to add a comment.
1 1 vote reversing a linked list in less than O(n) time is almost impossible sandeepjkh answered Aug 28, 2017 sandeepjkh comment Share Follow 0 reply Please log in or register to add a comment.
