Hello,
I've reviewed the repository and believe that including additional data structures would enhance the understanding of Data Structures and Algorithms.
Data Structures I propose to add to the repository:
1. Array
Insert an element at a specified location
Access/Search for an element
Delete an element from a specified location
2. Queue
Add an element
Peek at the element
Remove the element
3. Linked List
Singly Linked List
-> Create a singly linked list
-> Insert an element at a specific position
-> Search for an element
-> Delete an element at a specific position
Doubly Linked List
-> Create a doubly linked list
-> Insert an element at a specific position
-> Search for an element
-> Delete an element at a specific position
Circular Linked List
-> Create a circular linked list
-> Insert an element at a specific position
-> Search for an element
-> Delete an element at a specific position
Doubly Circular Linked List
-> Create a doubly circular linked list
-> Insert an element at a specific position
-> Search for an element
-> Delete an element at a specific position
Hello, I've reviewed the repository and believe that including additional data structures would enhance the understanding of Data Structures and Algorithms.
Data Structures I propose to add to the repository:
1. Array
2. Queue
3. Linked List
Singly Linked List -> Create a singly linked list -> Insert an element at a specific position -> Search for an element -> Delete an element at a specific position
Doubly Linked List -> Create a doubly linked list -> Insert an element at a specific position -> Search for an element -> Delete an element at a specific position
Circular Linked List -> Create a circular linked list -> Insert an element at a specific position -> Search for an element -> Delete an element at a specific position
Doubly Circular Linked List -> Create a doubly circular linked list -> Insert an element at a specific position -> Search for an element -> Delete an element at a specific position