Join our Hacktoberfest initiative and contribute to open-source programming and data structures & algorithms projects. It's a great opportunity for beginners to learn and grow. Let's build a stronger community together.
This implementation introduces a Linked List Data Structure implementation, providing essential linked list operations with dynamic memory allocation.
The module includes a LinkedList class with nine primary methods:
insertStart() to insert a node at the start of the linked list insertEnd() to insert a node at the end of the linked list
insertIndex() to insert a node at the given index of the linked list
removeStart() to remove a node at the start of the linked list
removeEnd() to remove a node at the end of the linked list
removeIndex() to remove a node at the given index of the linked list
removeData() to remove a node with the given data
updateNode() to change the data of the node at the given index to the new value
printList() to print the linked list
Tech Stack and Dependencies
Programming Language: Python 3.x
Type of change
[ ] New Project
[X] New Feature
[ ] Bug fix
Issue number:
Fixes #32
Checklist:
[X] I have included a README.md file for my project clearly explaining its purpose, functionality, and usage instructions (applicable for new projects, not bug fixes).
[X] My code adheres to the style guidelines outlined by this project.
[X] I have thoroughly reviewed my code to identify and address any potential errors or inconsistencies.
[X] I have added clear and concise comments to my code, especially in sections that might be challenging to understand at first glance.
[X] I have reviewed and followed the project's Contributing Guidelines to ensure my contribution aligns with the project's requirements.
Description
Tech Stack and Dependencies
Type of change
Issue number: Fixes #32
Checklist: