name="google_ads_frame" marginwidth="0" marginheight="0" src="http://pagead2.googlesyndication.com/pagead/ads?client=ca-pub-5572165936844014&dt=1194442938015&lmt=1194190197&format=336x280_as&output=html&correlator=1194442937843&url=file%3A%2F%2F%2FC%3A%2FDocuments%2520and%2520Settings%2Flhh1%2F%E6%A1%8C%E9%9D%A2%2FCLanguage.htm&color_bg=FFFFFF&color_text=000000&color_link=000000&color_url=FFFFFF&color_border=FFFFFF&ad_type=text&ga_vid=583001034.1194442938&ga_sid=1194442938&ga_hid=1942779085&flash=9&u_h=768&u_w=1024&u_ah=740&u_aw=1024&u_cd=32&u_tz=480&u_java=true" frameborder="0" width="336" scrolling="no" height="280" allowtransparency="allowtransparency"> #include <stdio.h>
#include <alloc.h>
void main(void)
{
int i;
struct ListEntry
{
int number;
struct ListEntry *next;
} start, *node, *previous;
start.next = NULL; // Empty list
node = &start; // Point to the start of the list
for (i = 1; i <= 10; i++)
{
node->next = (struct ListEntry *)
malloc(sizeof(struct ListEntry));
node = node->next;
node->number = i;
node->next = NULL;
}
node = start.next; // Remove the number 5
previous = &start;
while (node)
if (node->number == 5)
{
previous->next = node->next;
free(node);
break; // End the loop
}
else
{
node = node->next;
previous = previous->next;
}
node = start.next; // Display the list
while (node)
{
printf("%d ", node->number);
node = node->next;
}
}