Of the three variations of the linked lists (circular, with header and trailer n

Question

Of the three variations of the linked lists (circular, with header and trailer nodes, and doubly lInked) which would be most appropriate for each of the following applications?

a. You want to search a list for a key and return the keys of the elements that come before it and the keys of the two elements that come after it.

b. A text file contains integer elements one per line, sorted from smallest ton largest. You must read the values from the fiklle and create a sorted list containing the values.

c. A list is short and frequently becomes empty. You want a list that is optimal for insertin an element into the empty list and deleting the last element from the list.

Explanation / Answer

a) doubly lInked b) with header and trailer nodes c) with header and trailer nodes

Related Questions

Navigate

• Browse (All)
• Browse O
• Subjects

---

---

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