Here is the best, worst, and average-case complexity for doubly linked list operations. It is similar to that of singly linked list operations:
|
Operation |
Time Complexity: Worst Case |
Time Complexity: Average Case |
|
Insert at beginning or end |
O(1) |
O(1) |
|
Delete at beginning or end |
O(1) |
O(1) |
|
Search |
O(n) |
O(n) |
|
Access |
O(n) |
O(n) |
Get PHP 7 Data Structures and Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.
Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.
Start your free trial Become a member now