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.
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++.
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++.
#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;
}#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;
}- Basic implementation of Primitive List
- Advanced implementation of Doubly Linked List
- Examples of common operations (insertion, deletion, traversal)
- Well-documented code for easy understanding
- C++
- GitHub for version control
- Clone the repository:
git clone https://github.com/n4vrl0s3/Primitive-List-Doubly-Linked-List.git
- Navigate to the project directory:
cd Primitive-List-Doubly-Linked-List
- Compile the code using a C++ compiler:
g++ -o main main.cpp
- Run the executable:
./main
This project is licensed under the MIT License. See the LICENSE file for details.