[PR #1502] Create Doubly_linkedlist.c #2105

New Issue

claunia · 2026-01-29T15:28:46Z

claunia commented

2026-01-29 15:28:46 +00:00

Original Pull Request: https://github.com/TheAlgorithms/C/pull/1502

State: closed
Merged: No

This C program implements a Doubly Linked List (DLL), a linear data structure in which each node contains three parts — data, a pointer to the previous node, and a pointer to the next node. Unlike a singly linked list, a doubly linked list allows bidirectional traversal, enabling easier insertion and deletion from both ends of the list.

The program provides a menu-driven interface that allows users to:

Insert a node at the beginning of the list

Insert a node at the end of the list

Delete a specific node by its value

Display the list in forward order (from head to tail)

Display the list in reverse order (from tail to head)

It uses dynamic memory allocation (malloc) for creating new nodes and ensures that node connections are properly updated during insertions and deletions. The program continues running until the user chooses to exit.

Description of Change

References

Checklist

Added description of change
Added file name matches File name guidelines
Added tests and example, test must pass
Relevant documentation/comments is changed or added
PR title follows semantic commit guidelines
Search previous suggestions before making a new one, as yours may be a duplicate.
I acknowledge that all my contributions will be made under the project's license.

Notes:

**Original Pull Request:** https://github.com/TheAlgorithms/C/pull/1502 **State:** closed **Merged:** No --- This C program implements a Doubly Linked List (DLL), a linear data structure in which each node contains three parts — data, a pointer to the previous node, and a pointer to the next node. Unlike a singly linked list, a doubly linked list allows bidirectional traversal, enabling easier insertion and deletion from both ends of the list. The program provides a menu-driven interface that allows users to: Insert a node at the beginning of the list Insert a node at the end of the list Delete a specific node by its value Display the list in forward order (from head to tail) Display the list in reverse order (from tail to head) It uses dynamic memory allocation (malloc) for creating new nodes and ensures that node connections are properly updated during insertions and deletions. The program continues running until the user chooses to exit. #### Description of Change  #### References  #### Checklist  - [x] Added description of change - [x] Added file name matches [File name guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#File-Name-guidelines) - [ ] Added tests and example, test must pass - [ ] Relevant documentation/comments is changed or added - [ ] PR title follows semantic [commit guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#Commit-Guidelines) - [ ] Search previous suggestions before making a new one, as yours may be a duplicate. - [ ] I acknowledge that all my contributions will be made under the project's license. Notes:

claunia added the pull-request label 2026-01-29 15:28:47 +00:00

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#2105