This preview shows page 1. Sign up to view the full content.
Unformatted text preview: e) Show how to dynamically (with new) allocate an array of 50 nodes f) Show how to dynamically (with new) allocate an array of 50 node pointers (i.e., 50 head pointers) a. Assuming that other nodes have been addedWrite an iterative function to insert a node at the end of the last linked list g) Write the code to show how you would deallocate all dynamic memory for an array of linear linked lists. Dont forget to deallocate all of the LLL and the array afterwards....
View Full Document
This note was uploaded on 10/16/2011 for the course CS 163 taught by Professor Fant during the Spring '09 term at Portland State.
- Spring '09