Skip to content

Update circularListinsertion #23

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
deepika-arora wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update circularListinsertion #23

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
9 changes: 4 additions & 5 deletions circularListinsertion
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,17 +2,16 @@ struct Node *addToEmpty(struct Node *last, int data)
{
// This function is only for empty list
if (last != NULL)
return last;
return last;

// Creating a node dynamically.
struct Node *temp =
(struct Node*)malloc(sizeof(struct Node));
struct Node *temp = (struct Node*)malloc(sizeof(struct Node));

// Assigning the data.
temp -> data = data;
last = temp;
// Note : list was empty. We link single node
// to itself.

// Note : list was empty. We link single node to itself.
temp -> next = last;

return last;
Expand Down