PROJECT: DOUBLY LINKED LISTS (dll0)

OBJECTIVE

Evolving our singly-linked list implementation to a doubly-linked list.

TASK

By the deadline, please do the following:

  • add a prev Node pointer to your Node struct
  • update the logic in insert(), append(), and obtain() for use with the prev pointer (should simplify some things, lessen the need for as many temporary variables)
  • as appropriate, update other linked list functions if the prev has any transactions there (mknode(), for instance)

SUBMISSION

130:dll0:final tally of results (130/130)
*:dll0:update node struct [13/13]
*:dll0:update and test mknode function [13/13]
*:dll0:update and test rmnode function [13/13]
*:dll0:adapt and test insert function [26/26]
*:dll0:adapt and test append function [26/26]
*:dll0:adapt and test obtain function [26/26]
*:dll0:code is well commented, organized, functional [26/26]

Additionally:

  • Solutions not abiding by spirit of project will be subject to a 25% overall deduction
  • Solutions not utilizing descriptive why and how comments will be subject to a 25% overall deduction
  • Solutions not utilizing indentation to promote scope and clarity will be subject to a 25% overall deduction
  • Solutions not organized and easy to read (assume a terminal at least 90 characters wide, 40 characters tall) are subject to a 25% overall deduction