Skip to content
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.

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

merged two sorted linked lists. #101

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

Conversation

shalupatidar22
Copy link

This pull request introduces a function that merges two sorted singly linked lists into one sorted linked list. The key changes include:

Node Structure: Defines the structure for linked list nodes with data and next pointers.
Linked List Operations:
create() and create2(): Initialize two linked lists from two separate arrays.
merge(): Merges two pre-sorted linked lists into a new sorted linked list.
display(): Recursively displays the contents of the linked list.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant