Simple Single-chain table implementation and display
/*
* ===================================================== ========================================================== ======
*
* Filename: link1.c
*
* Description:
*
* Version: 1.0
* Created: 06/08/2012 10:38:46
* Revision: None
* Compiler: gcc
*
* Author: Your name (),
* Organization:
*
* ===================================================== ========================================================== ======
*/
# Include <stdlib. h>
# Include <stdio. h>
Typedef struct _ node * link;
Struct _ node {
Int data;
Link next;
};/* Define the node */
Typedef struct _ node;
Void display (link headl)/* linked list display * // * headl indicates that the ITER of the linked list header is the traversal pointer */
{
Link ITER;
Iter = headl;
While (ITER-> next)
{
Printf ("% 5d", ITER-> next-> data );
Iter = ITER-> next;
}
}
Main ()
{
Int I, N;
Link head, ITER;
Printf ("Enter num N:");/* generate a linked list */
Scanf ("% d", & N );
Head = (Link) malloc (sizeof (node ));
Head-> DATA =-1;
Head-> next = NULL;/* initialize the header */
Iter = head;
For (I = N; I> 0; I --)
{
ITER-> next = (Link) malloc (sizeof (node ));
Iter = ITER-> next;
Scanf ("% d", & (ITER-> data ));
}
Display (head );
}