This project implements a sorted doubly-linked list in C++. It was developed as an academic exercise to deepen the understanding of dynamic memory management and basic data structures.
The list maintains its elements in ascending order and includes standard operations such as:
- Inserting elements in sorted order
- Removing elements
- Searching for values
- Printing elements in ascending and descending order
- Merging two sorted lists
- Maintains elements sorted on insertion
- Traversal from beginning to end (ascending) or in reverse (descending)
- Exception handling for empty lists or out-of-range operations
- Merge functionality to combine two sorted lists into a new one
ListaOrdenada.hpp: main class definition and interfaceListaOrdenada.tpp: template method implementationsListaDoble2.hpp: supporting double-linked list class used internally
- Ana Laura Chenoweth Galaz
- Georgina Salcido Valenzuela
This project is intended for academic use. You are free to use or modify it for learning purposes.