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
Consider a sorted circular doubly-linked list where the head element points to the smallest element in the list. What is
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Consider a sorted circular doubly-linked list where the head element points to the smallest element in the list. What is
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!