Program to add a new node to the asscending order linked list
#include > #include > #include > /* structure containing a data part and link part */ struct node { int data ; struct node *link ; } ; void add ( struct node **, int ) ; void display ( struct node * ) ; int count ( struct node * ) ; void delete ( struct node **, int ) ; void main( ) { struct node *p ; p = NULL ; /* empty linked list */ add ( &p, 5 ) ; add ( &p, 1 ) ; add ( &p, 6 ) ; add ( &p, 4 ) ; add ( &p, 7 ) ; clrscr( ) ; display ( p ) ; printf ( "\nNo. of elements in Linked List = %d", count ( p ) ) ; } /* adds node to an ascending order linked list */ void add ( struct node **q, int num ) { struct node *r, *temp = *q ; r = malloc ( sizeof ( struct node ) ) ; r -> data = num ; /* if list is empty or if new node is to be inserted before the first node */ if ( *q == NULL || ( *q ) -> data > num ) { *q = r ; ( *q ) -> link = temp ; } else { /* traverse the entire linked list to search the position to inser...