Skip to content

This repository features a fundamental implementation of a doubly linked list in Python. It demonstrates key operations such as insertion, deletion, and traversal in a doubly linked list structure. Ideal for learners and developers looking to understand or revisit the basics of data structures and algorithm design.

License

Notifications You must be signed in to change notification settings

sha-env/Primitive-List-Doubly-Linked-List

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Primitive List Doubly Linked List

This repository aims to provide a comprehensive starting point for understanding and implementing two fundamental data structures: a Primitive List and a Doubly Linked List. These data structures are implemented in C++ and serve as a great introduction to list manipulation and linked list concepts for beginners and intermediate programmers.



Purpose of This Repository

Primitive List

A Primitive List is a basic data structure that allows storing a collection of elements in a sequential manner. This repository provides examples of how to create, manipulate, and perform common operations on primitive lists in C++.

Doubly Linked List

A Doubly Linked List is a more advanced data structure where each node contains a reference to both the next and the previous node in the sequence. This allows for more efficient insertion and deletion operations compared to a singly linked list. This repository includes examples of how to implement and manipulate doubly linked lists in C++.



Demonstration

Primitive List Example

#include <iostream>
#include "PrimitiveList.h"

int main() {
    PrimitiveList<int> list;
    list.append(1);
    list.append(2);
    list.append(3);
    list.display(); // Output: 1 2 3
    return 0;
}

Doubly Linked List Example

#include <iostream>
#include "DoublyLinkedList.h"

int main() {
    DoublyLinkedList<int> list;
    list.append(1);
    list.append(2);
    list.append(3);
    list.display(); // Output: 1 2 3
    return 0;
}


Features

  • Basic implementation of Primitive List
  • Advanced implementation of Doubly Linked List
  • Examples of common operations (insertion, deletion, traversal)
  • Well-documented code for easy understanding


Technologies Used

  • C++
  • GitHub for version control


Project Setup

  1. Clone the repository:
    git clone https://github.com/n4vrl0s3/Primitive-List-Doubly-Linked-List.git
  2. Navigate to the project directory:
    cd Primitive-List-Doubly-Linked-List


Steps to Run

  1. Compile the code using a C++ compiler:
    g++ -o main main.cpp
  2. Run the executable:
    ./main


License

This project is licensed under the MIT License. See the LICENSE file for details.



About

This repository features a fundamental implementation of a doubly linked list in Python. It demonstrates key operations such as insertion, deletion, and traversal in a doubly linked list structure. Ideal for learners and developers looking to understand or revisit the basics of data structures and algorithm design.

Topics

Resources

License

Code of conduct

Security policy

Stars

Watchers

Forks

Sponsor this project

Languages