This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: linked list was a dynamically allocated array of characters 6) Write the code to copy the entire contents of a linear linked list (of integers) creating a new (empty to begin with) linear linked list. 7) Now, change your answer to #6 assuming that the data in each node is now a dynamically allocated array of characters. 8) ITERATIVELY: Write a function that will delete from an unsorted linked list of integers the node that contains the largest item, using only a single traversal. ***do this iteratively *** Recursion 9) Write a recursive function to find out if your name is stored in a linear linked list of names. 10) Write a recursive function to display the last node of a linear linked list....
View Full Document
- Spring '09