Assume you are given a linked list implementation that uses a head pointer but n

Question

Assume you are given a linked list implementation that uses a head pointer but no tail pointer. Which of the following operations will be the fastest? A) insert_front B) insert_tail C) delete_value D) A and B E) B and C Assume you are given a linked list implementation that uses a head pointer but no tail pointer. Which of the following operations will be the slowest? A) insert_front B) insert_tail C) delete_value D) A and B E) B and C Assume you are given a doubly linked list implementation that uses a head pointer and a tail pointer and each node has a prev and a next pointer. Which of the following operations will be faster than a standard single linked list? A) insert_front B) insert_tail C) delete_value D) A and B E) B and C

Explanation / Answer

When there is a head pointer, it will point to the first(front) element in the list.
So, A. insert_front operation can be done with just a single step.

When there is a head pointer, to insert an element into the last position, you obviously
have to travel till the end of the list (the whole list) to insert an element.
So, B) insert_tail will be the slowest.

When you have a both head pointer as well as tail pointer, A) insert_front, B) insert_tail
are both just a single step operations.
So, D. A and B is the answer.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.