This preview shows page 1. Sign up to view the full content.
Unformatted text preview: on. Another legal would be to solution 43, 0, 19, 7, 8] about how many vaLues are in the l-ist You may not make any assumptions and you are not allowed or to create to swap data fields any new nodes to solve problem. You must rearrange the list by rearranging the l-inks of the this You also may not use auxiliary like Arrayl.lsts, structures arrays, list. problem, queues, you may use recursion, etc, although to solve this stacks, 9. that takes a second list as a parameter Write a method transferFrom and that you are to join from the second list First to this list. moves va...
View Full Document
This note was uploaded on 11/03/2009 for the course CSE 143 taught by Professor Sr during the Spring '08 term at University of Washington.
- Spring '08