single vs double Linked list
<p>There is a table I found below
<a href="https://i.stack.imgur.com/jEvTz.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/jEvTz.jpg" alt="enter image description here"></a></p>

<p>My question is whether or not it is true that a single and double linked list have the same operation run times like the table seems to show. I would think in the deletion case for example, a double linked list would be better since we have access to previous. So is the table wrong on that being O(n) for singly linked lists?</p>

<p>If they are all the same, does this similarity hold for a circular one as well?</p>

<p>Thanks. </p>