Skip to content

Update Linkedlist.c #973

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Vaikuntram wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update Linkedlist.c #973

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 13 additions & 5 deletions C/Linkedlist.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ struct Node {
//Complexity: O(n) where n = number of nodes
void LLTraversal(struct Node* ptr){
while(ptr!=NULL){
printf("%d\n", ptr->data);
printf("%d ", ptr->data);
ptr = ptr->next;
}
}
Expand All @@ -26,16 +26,24 @@ int main()
third = (struct Node*)malloc(sizeof(struct Node));
fourth = (struct Node*)malloc(sizeof(struct Node));

head->data = 7;
printf("Enter the first node's value: ");
scanf("%d",&head->data);
//head->data = 7;
head->next = second;

second->data = 11;
printf("Enter the second node's value: ");
scanf("%d",&second->data);
//second->data = 11;
second->next = third;

third->data = 66;
printf("Enter the third node's value: ");
scanf("%d",&third->data);
//third->data = 66;
third->next = fourth;

fourth->data = 2;
printf("Enter the fourth node's value: ");
scanf("%d",&fourth->data);
//fourth->data = 2;
fourth->next = NULL;

LLTraversal(head);
Expand Down