Summary: 10/21/2010
1
Pointer Review
10/21/2010
2
Node {
int value;
Node * next;
Node( int val =1, Node * n = NULL) {value = val; next = n;}
}
· Given a ordered linked list pointed to by head,
write the code to insert an element with value x.
Node {
int value;
Node * next;
Node( int val =1, Node * n = NULL) {value = val; next = n;}
}}
· Given a ordered linked list pointed to by head,
write the code to delete an element with value x.
10/21/2010

Source: Allan, Vicki H. - Department of Computer Science, Utah State University

Collections: Computer Technologies and Information Sciences