Summary of Doubly Linked List
Insertion:
Beginning O(1)
In Order O(log
2
n)
End O(1)*
Deletion:
Beginning O(1)
In Order O(log
2
n)
End O(1)*
Search:
O(log
2
n)
* n nodes traversed, but no link/pointer comparisons to null
