Consider a sorted circular doubly-linked list where the head element points to the smallest element in the list. What is
Posted: Fri May 20, 2022 11:59 am
Consider a sorted circular doubly-linked list where the head
element points to the smallest element in the list.
What is the asymptotic complexity, O (big O), of
deleting a given element e in the list (not including the cost of
finding it)? Explain your answer
element points to the smallest element in the list.
What is the asymptotic complexity, O (big O), of
deleting a given element e in the list (not including the cost of
finding it)? Explain your answer