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: lt;T> class shown below (the first and last pointers and the Node struct) ● Remember, the Node struct DOES NOT have a prev pointer as it did in project 5 tmlt tpnm > epae<yeaeT casLs ls it{ ulc pbi: .. . /RQIE:ls sntepy /EURS iti o mt /MDFE:ti /OIIS hs /EFCS rmvsteie ttebc ftels n eun t /FET: eoe h tma h ako h itadrtrsi / t h alr / otecle TrmvBc(; eoeak) /.. /. rvt: piae src oe{ tutNd Nd nx;/ onst h etNd nls,0i oe oe*et /pit otenx oei it fnn / hr sn rvpr /Teei ope t! Tdtm / od htvrtp trdi it au; /hlswaee yesoe nls } ; Nd frt /pit ofrtNd nls,0i iti mt oe*is;/ onst is oei it fls sepy Nd ls; /pit ols oei it fls sepy oe*at / onst atNd nls,0i iti mt } ; Write your answer on the next page. You may tear this page out. EECS 280 Fall 2013 17/25 uniqname: _________________________ tmlt tpnm > epae<yeaeT TLs<>:eoeak){ itT:rmvBc( } 4B) (4 Points) After writing removeBack(), a friend of yours decides to re­write removeall() to EECS 280 Fall 2013 18/25 uniqname: _________________________ use removeBack() instead of removeFront(), as shown be...
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