void main(){
struct Node *head1 = NULL;
struct Node *head2 = NULL;
int result=0;
printf("Program to comapre 2 linked list \n");
int data = 0, i = 0;
printf("Start entering data for first list: \n");
for(i=0;i<10;i++){ /* Fill the 1 list */
printf("Enter data for 1st list: \n");
scanf("%d", &data);
head1 = Insert_end(head1, data);
}
printf("Start entering data for second list: \n");
for(i=0;i<10;i++){ /* Fill the 1 list */
printf("Enter data for 2nd list: \n");
scanf("%d", &data);
head2 = Insert_end(head2, data);
}
Print(head1); /* print the 1 list */
Print(head2); /* print the 1 list */
result = compare(head1, head2); /* pass head for both list to compare function and save result in a variable */
if(result == 1){
printf("True"); /* Print True if list is same */
}
else{
printf("False"); /* Print False if list is same */
}
}
int main()
{
Insert_front(10);
Insert_after(start,1);
Insert_end(100);
Insert_front(4);
Insert_end(400);
printf("Has Loop = %s\n", (PASS==has_loop())?"Yes":"No");
print_all();
start = reverse();
printf("After Reversal:\n");
print_all();
reverse_using_recurrsion(start);
printf("After Reversal:\n");
print_all();
destroy_all();
}
void main(){
head = NULL;
int data = 0, i=0,n=0;
printf("Program to delete a node from position 'n' in a linked list \n");
printf("Enter data to make a linked list \n");
for(i=0;i<10;i++){
printf("Enter the number \n");
scanf("%d", &data);
Insert_end(data);
}
Print();
for(i=0;i<3;i++){
printf("Enter the element to delete \n");
scanf("%d", &n);
Delete_nth(n);
}
Print();
}
