{"id":19725212,"url":"https://github.com/momen-alshouha/data-structure-doubly-linked-list","last_synced_at":"2026-06-17T14:32:17.156Z","repository":{"id":249246127,"uuid":"741571401","full_name":"Momen-Alshouha/data-structure-doubly-linked-list","owner":"Momen-Alshouha","description":"This repository contains C++ implementation of a doubly linked list using object-oriented programming principles. It includes classes for nodes, iterators, and the linked list itself, providing essential functionalities such as insertion, deletion, traversal, and more. ","archived":false,"fork":false,"pushed_at":"2024-01-12T07:34:58.000Z","size":32,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-28T01:20:42.825Z","etag":null,"topics":["classes-and-objects","cpp","data-structures","doubly-linked-list","linked-list","object-detection","object-oriented-programming"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Momen-Alshouha.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-01-10T17:09:04.000Z","updated_at":"2024-07-19T06:54:13.000Z","dependencies_parsed_at":"2024-07-19T16:18:33.284Z","dependency_job_id":null,"html_url":"https://github.com/Momen-Alshouha/data-structure-doubly-linked-list","commit_stats":null,"previous_names":["momen-alshouha/data-structure-doubly-linked-list"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Momen-Alshouha/data-structure-doubly-linked-list","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Momen-Alshouha%2Fdata-structure-doubly-linked-list","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Momen-Alshouha%2Fdata-structure-doubly-linked-list/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Momen-Alshouha%2Fdata-structure-doubly-linked-list/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Momen-Alshouha%2Fdata-structure-doubly-linked-list/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Momen-Alshouha","download_url":"https://codeload.github.com/Momen-Alshouha/data-structure-doubly-linked-list/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Momen-Alshouha%2Fdata-structure-doubly-linked-list/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34453431,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-17T02:00:05.408Z","response_time":127,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["classes-and-objects","cpp","data-structures","doubly-linked-list","linked-list","object-detection","object-oriented-programming"],"created_at":"2024-11-11T23:28:39.786Z","updated_at":"2026-06-17T14:32:17.139Z","avatar_url":"https://github.com/Momen-Alshouha.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Doubly Linked List Implementation in C++\n\nThis repository contains an implementation of a doubly linked list using C++ and Object-Oriented Programming principles.\n\n## Overview\n\n### Classes\n- **Node**: Represents individual nodes in the doubly linked list.\n- **Iterator**: Provides iteration capabilities over the linked list.\n- **DoublyLinkedList**: Implements the doubly linked list and its functionalities.\n\n## Classes and Functionality\n\n### Node Class\nThe `Node` class represents individual elements in the singly linked list. Each node holds:\n- `_Data`: Data of type `T`.\n- `_ptrToNext`: Pointer to the next node.\n- `_ptrToPrev`: Pointer to the previous node.\n\n### Iterator Class\nThe `Iterator` class provides functionality for iterating through the singly linked list. It includes methods to:\n- Access node data.\n- Set node data.\n- Move to the next node.\n- Access the current node.\n\n### DoublyLinkedList Class\nThe `DoublyLinkedList` class represents a doubly linked list with various functionalities:\n\n- **Properties:**\n  - `head`: Returns the head of the list.\n  - `tail`: Returns the tail of the list.\n  - `length`: Returns the number of nodes in the list.\n\n- **Search and Access:**\n  - `Find(data)`: Finds the node with the specified data.\n  - `FindByIndex(index)`: Finds the node at the specified index.\n  - `isExist(data)`: Checks if a node with the given data exists.\n\n- **Insertion:**\n  - `InsertBegin(data)`: Inserts a new node at the beginning.\n  - `InsertEnd(data)`: Inserts a new node at the end.\n  - `InsertBefore(dataBefore, newData)`: Inserts a new node before a specified node.\n  - `InsertAfter(dataAfter, newData)`: Inserts a new node after a specified node.\n  - `InsertAtIndex(index, value)`: Inserts a new node at a specified index.\n\n- **Deletion:**\n  - `DeleteFront()`: Deletes the first node.\n  - `DeleteBack()`: Deletes the last node.\n  - `DeleteAtIndex(index)`: Deletes the node at a specified index.\n\n- **Update:**\n  - `UpdateAtIndex(index, newValue)`: Updates the value of the node at a specified index.\n\n- **Concatenation:**\n  - `Concat(other)`: Concatenates the current list with another list.\n\n- **Additional Features:**\n  - `IsPalindrome()`: Checks if the list is a palindrome.\n  - `GetNthNodeValue(N)`: Returns the value of the node at the Nth position.\n  - `Reverse()`: Reverses the order of nodes in the list.\n  - `Clear()`: Clears the entire list.\n\n- **Printing:**\n  - `PrintFromFront()`: Prints the list from the head to the tail.\n  - `PrintFromBack()`: Prints the list from the tail to the head.\n\n## Usage\n\nTo use this singly linked list implementation, follow these steps:\n1. Clone the repository.\n2. Include the necessary header files in your C++ code: `Node.h`, `Iterator.h`, and `LinkedList.h`.\n3. Create a `LinkedList` object and utilize its functionalities as per your requirements.\n\n## Example\n\n```cpp\n// Example usage of the LinkedList class\n#include \"DoublyLinkedList.h\"\n\nint main() {\n    DoublyLinkedList\u003cint\u003e myIntsList; // list of integers\n    DoublyLinkedList\u003cstring\u003e myStringsList; // list of strings\n    \n    // Perform operations like insertion, deletion, and retrieval here\n    \n    return 0;\n}\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmomen-alshouha%2Fdata-structure-doubly-linked-list","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmomen-alshouha%2Fdata-structure-doubly-linked-list","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmomen-alshouha%2Fdata-structure-doubly-linked-list/lists"}