Tut_8 - Programming & Data Structures Tutorial 8 Q1....

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Programming & Data Structures Tutorial 8 Q1. (a) Using the provided partial program, fill in the grayed out areas in the main method. (b) After you have done that, try to implement the addNode method. (The addNode method adds a node after the specified position.) (c) If your feeling adventurous, try writing the method that will remove a node from a specified position in the linked list. NOTE: For simplicity, all class declarations and definitions are declared in the one source file along with the main class.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
/* * Tutorial 8 - Program that demonstrates linked lists * The program will create a linked list depending on a size given by the user and then procede * to demonstrate adding and removing from the linked list * * Thanh Giang * Created : 08/04/02 */ /********************************************************* * First lets declare our linked list structure * *********************************************************/ // define a node - it's going to be a singly linked list class node { }; // we need a start position pointerc
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/25/2010 for the course CPE CPE 360 taught by Professor Jenniferchen during the Spring '10 term at Stevens.

Page1 / 4

Tut_8 - Programming & Data Structures Tutorial 8 Q1....

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online