Skip to content
Related Articles

Related Articles

Can we reverse a linked list in less than O(n)?

Improve Article
Save Article
  • Difficulty Level : Easy
  • Last Updated : 26 Jul, 2022
Improve Article
Save Article

It is not possible to reverse a simple singly linked list in less than O(n). A simple singly linked list can only be reversed in O(n) time using recursive and iterative methods. 

A doubly linked list with head and tail pointers while only requiring swapping the head and tail pointers which require lesser operations than a singly linked list can also not be done in less than O(n) since we need to traverse till the end of the list anyway to find the tail node.

This article is contributed by Abhishek and moharibishal Please write comments if you find anything incorrect, or if you want to share more information about the topic discussed above.
 

Complete Interview Preparation - GFG

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!