Example & Tutorial understanding programming in easy ways.

What is time complexity in Linked list?

Time complexity in Singly Linked list:

Creating linked list : O(n)
Traversing Linked List : O(n)
Insertion at beginning : O(1)
Insertion at last : O(n)
Deletion at beginning : O(1)
Deletion at end : O(n)
Searching of item : O(n)

Time complexity in Circular Linked list:

Creating linked list : O(n)
Traversing Linked List : O(n)
Insertion at beginning : O(n)
Insertion at last : O(n)
Deletion at beginning : O(n)
Deletion at end : O(n)
Searching of item : O(n)

Time complexity in Doubly Linked list:

Creating linked list : O(n)
Traversing Linked List : O(n)
Insertion at beginning : O(1)
Insertion at last : O(1)
Deletion at beginning : O(1)
Deletion at end : O(1)
Searching of item : O(logn)