eecs280f13_FinalExam

Removeallstillworksbutyou

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: /25 uniqname: _________________________ / EURS usi ito oiieitgr,n> /RQIE:nm sals fpstv nees =0 / FET:Pit l lmnsi usta r utpe fn /EFCS rnsaleeet nnm htaemlilso , uigieaosadfn_f sn trtr n idi pitmlilsitn os itit nm){ rn_utpe(n ,cntLs<n>&us } EECS 280 Fall 2013 16/25 uniqname: _________________________ Question 4: Linked Lists and Templates (20 points) As you discovered in project 5, having a doubly linked list allows for easy removal of the last node in the list because previous nodes can be easily modified. However, this functionality is still often desired even if single linking is used, as in the List<T> from lecture. 4A) (12 Points) Implement the following function to remove the last node from the singly linked list we used in lecture. Restrictions: ● Do not use standard library functions, recursion, or helper functions ● Do not use any of the other functions in the List<T> class, such as isEmpty ● The function can be written only using the private members of the List&...
View Full Document

This test prep was uploaded on 03/10/2014 for the course EECS 280 taught by Professor Noble during the Winter '08 term at University of Michigan.

Ask a homework question - tutors are online