let list be doubly linked list of integers. to find the element in list (of size
ID: 3829938 • Letter: L
Question
let list be doubly linked list of integers. to find the element in list (of size n) containing key what is the worst case time complexity? let list be doubly linked list of integers. to find the element in list (of size n) containing key what is the worst case time complexity? let list be doubly linked list of integers. to find the element in list (of size n) containing key what is the worst case time complexity? let list be doubly linked list of integers. to find the element in list (of size n) containing key what is the worst case time complexity?Explanation / Answer
we know that for a doubly linked list,its constant time to remove an element once .
The wrost case time complexity is o(n).
down vote
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.