Data structures part 1 Singly linked list.pdf - Google Drive

Singly Linked List Declaration of a node Struct node { int data; Struct node *link; };

Creating a New Node X= (Struct node *)malloc(sizeof(Struct node));

// ALLOCATES MEMORY TO NODE

Printf(“Enter the data:”);

Enter the Data :

Scanf(“%d”,&x->data);

&x->data =

x->link=Null; X

=

Head = X; Head= X=

Insertion of elements in List Y= (Struct node *)malloc(sizeof(Struct node)); Printf(“Enter the data:”);

Enter the Data :

Scanf(“%d”,&y->data);

&y->data =

y->link=null; x-> link=Y; Y=X; Here, after the insertion the Y node becomes X.

Insertion at first : Y= (Struct node *)malloc(sizeof(Struct node)); Printf(“Enter the data:”);

Enter the Data :

Scanf(“%d”,&y->data);

&y->data =

y->link=head;

Head

X

Head=Y;

Insertion at Middle: Int pos, c=1; Y= (Struct node *)malloc(sizeof(Struct node)); Printf(“Enter the data:”);

Enter the Data :

Scanf(“%d”,&y->data);

&y->data =

Printf(“enter the position to be inserted”); Scanf(“%d”,&pos); X=head;

X=head While(clink=X; z->link=Y; }

X= C++ =

Insertion at End: Y= (Struct node *)malloc(sizeof(Struct node)); Printf(“Enter the data:”);

Enter the Data :

Scanf(“%d”,&y->data);

&y->data =

y->link=NULL; X=head;

X=head

While(x->link! =NULL)

x->link =

{ X=x->link;

X=

} x->link=Y;

Deletion at Beginning: head

If(head==NULL) Printf(“\n list is empty”); Else { X=head; Head= x->link; Free(X);

}

Deletion at Middle: Int pos, c=1; If(head==NULL) Printf(“list is empty”); Else { Printf(“ enter the position to be deleted”); Scanf(“%d”,&pos); X= head; While(clink=x->link;

Free(X);

} }

X= C++ =

Deletion at End: head

If(head==NULL) Printf(“\n list is empty”); Else { X=head;

While(x->link! =NULL) { Y=X; X=x->link; }

y->link= NULL; Free(X); }

x->link = Y=

X=