Programming and Data Structures by Pearson

Linear Data Structure 507

Insert an element at starting: 3

Linked list elements are: 3 9 5 1 2 3 4

Explanation The creation of a linked list is same as explained in the previous program. Here, an

element is inserted at the beginning. The function void atbeg () performs this task. In this function

two pointers *node (local to this function) and *t are declared. The m alloc () function allocates

memory to pointer node. The entered element is placed in the newly created node. Consider the

following statements.

t=first;

header=node;

header - >next=t;

first=header;

The above four statements adjust the pointer links.

t=first: This statemen