Homework: Data Structures
In this homework, you will expand on the information provided in the course to answer the following questions in a 2 to 3 pages paper:
What is the difference between a singly-linked list and a doubly-linked list?
a. In what situation would you use a singly-linked list over a doubly-linked list?
b. In what situation would you use a doubly-linked list over a singly-linked list?
If a node is in a linked list with N nodes, how many nodes will be traversed during a search for the node?
a. Explain the best- and worst-case search scenarios.
b. Explain why a singly-linked list defines a RemoveAfter() function, while a doubly-linked list defines a Remove() function.
c. Could a RemoveAfter() function also be defined for a doubly-linked list? Explain why or why not.
d. Could a Remove() function also be defined for a singly-linked list? Explain why or why not.
Format your homework according to the give formatting requirements:
a. The answer must be double spaced, typed, using Times New Roman font (size 12), with one-inch margins on all sides.
b. The response also includes a cover page containing the title of the homework, the course title, the student's name, and the date. The cover page is not included in the required page length.
c. Also include a reference page. The references and Citations should follow APA format. The reference page is not included in the required page length.