https://github.com/momen-alshouha/data-structure-doubly-linked-list

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.
https://github.com/momen-alshouha/data-structure-doubly-linked-list

classes-and-objects cpp data-structures doubly-linked-list linked-list object-detection object-oriented-programming

Last synced: 19 days ago
JSON representation

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.

• Host: GitHub
• URL: https://github.com/momen-alshouha/data-structure-doubly-linked-list
• Owner: Momen-Alshouha
• Created: 2024-01-10T17:09:04.000Z (over 2 years ago)
• Default Branch: master
• Last Pushed: 2024-01-12T07:34:58.000Z (over 2 years ago)
• Last Synced: 2025-02-28T01:20:42.825Z (over 1 year ago)
• Topics: classes-and-objects, cpp, data-structures, doubly-linked-list, linked-list, object-detection, object-oriented-programming
• Language: C++
• Homepage:
• Size: 31.3 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Doubly Linked List Implementation in C++

This repository contains an implementation of a doubly linked list using C++ and Object-Oriented Programming principles.

## Overview

### Classes

- **Node**: Represents individual nodes in the doubly linked list.

- **Iterator**: Provides iteration capabilities over the linked list.

- **DoublyLinkedList**: Implements the doubly linked list and its functionalities.

## Classes and Functionality

### Node Class

The `Node` class represents individual elements in the singly linked list. Each node holds:

- `_Data`: Data of type `T`.

- `_ptrToNext`: Pointer to the next node.

- `_ptrToPrev`: Pointer to the previous node.

### Iterator Class

The `Iterator` class provides functionality for iterating through the singly linked list. It includes methods to:

- Access node data.

- Set node data.

- Move to the next node.

- Access the current node.

### DoublyLinkedList Class

The `DoublyLinkedList` class represents a doubly linked list with various functionalities:

- **Properties:**

  - `head`: Returns the head of the list.

  - `tail`: Returns the tail of the list.

  - `length`: Returns the number of nodes in the list.

- **Search and Access:**

  - `Find(data)`: Finds the node with the specified data.

  - `FindByIndex(index)`: Finds the node at the specified index.

  - `isExist(data)`: Checks if a node with the given data exists.

- **Insertion:**

  - `InsertBegin(data)`: Inserts a new node at the beginning.

  - `InsertEnd(data)`: Inserts a new node at the end.

  - `InsertBefore(dataBefore, newData)`: Inserts a new node before a specified node.

  - `InsertAfter(dataAfter, newData)`: Inserts a new node after a specified node.

  - `InsertAtIndex(index, value)`: Inserts a new node at a specified index.

- **Deletion:**

  - `DeleteFront()`: Deletes the first node.

  - `DeleteBack()`: Deletes the last node.

  - `DeleteAtIndex(index)`: Deletes the node at a specified index.

- **Update:**

  - `UpdateAtIndex(index, newValue)`: Updates the value of the node at a specified index.

- **Concatenation:**

  - `Concat(other)`: Concatenates the current list with another list.

- **Additional Features:**

  - `IsPalindrome()`: Checks if the list is a palindrome.

  - `GetNthNodeValue(N)`: Returns the value of the node at the Nth position.

  - `Reverse()`: Reverses the order of nodes in the list.

  - `Clear()`: Clears the entire list.

- **Printing:**

  - `PrintFromFront()`: Prints the list from the head to the tail.

  - `PrintFromBack()`: Prints the list from the tail to the head.

## Usage

To use this singly linked list implementation, follow these steps:

1. Clone the repository.

2. Include the necessary header files in your C++ code: `Node.h`, `Iterator.h`, and `LinkedList.h`.

3. Create a `LinkedList` object and utilize its functionalities as per your requirements.

## Example

```cpp

// Example usage of the LinkedList class

#include "DoublyLinkedList.h"

int main() {

    DoublyLinkedList myIntsList; // list of integers

    DoublyLinkedList myStringsList; // list of strings

    

    // Perform operations like insertion, deletion, and retrieval here

    

    return 0;

}