# Data Structures - Q&A

- Linked List
- Linked List - Traversal
- Linked List - Insert a new node at the start
- Linked List - Insert a new node at the end
- Linked List - Insert a new node at a given position
- Linked List - Delete the first node
- Linked List - Delete the last node
- Linked List - Delete a node at a given position
- Linked List - Delete all nodes
- Linked List - Count nodes
- Linked List - Delete even nodes
- Linked List - Delete odd nodes
- Linked List - Search an element
- Linked List - Delete first node by key
- Linked List - Delete last node by key
- Linked List - Delete all nodes by key
- Linked List - Reverse the List

- Circular Singly Linked List
- Circular Singly Linked List - Traversal
- Circular Singly Linked List - Insert a new node at the start
- Circular Singly Linked List - Insert a new node at the end
- Circular Singly Linked List - Insert a new node at a given position
- Circular Singly Linked List - Delete the first node
- Circular Singly Linked List - Delete the last node
- Circular Singly Linked List - Delete a node at a given position
- Circular Singly Linked List - Delete all nodes
- Circular Singly Linked List - Count nodes
- Circular Singly Linked List - Delete even nodes
- Circular Singly Linked List - Delete odd nodes
- Circular Singly Linked List - Search an element
- Circular Singly Linked List - Delete first node by key
- Circular Singly Linked List - Delete last node by key
- Circular Singly Linked List - Delete all nodes by key
- Circular Singly Linked List - Reverse the List

- Doubly Linked List
- Doubly Linked List - Traversal
- Doubly Linked List - Insert a new node at the start
- Doubly Linked List - Insert a new node at the end
- Doubly Linked List - Insert a new node at a given position
- Doubly Linked List - Delete the first node
- Doubly Linked List - Delete the last node
- Doubly Linked List - Delete a node at a given position
- Doubly Linked List - Delete all nodes
- Doubly Linked List - Count nodes
- Doubly Linked List - Delete even nodes
- Doubly Linked List - Delete odd nodes
- Doubly Linked List - Search an element
- Doubly Linked List - Delete first node by key
- Doubly Linked List - Delete last node by key
- Doubly Linked List - Delete all nodes by key
- Doubly Linked List - Reverse the List

- Circular Doubly Linked List
- Circular Doubly Linked List - Traversal
- Circular Doubly Linked List - Insert a new node at the start
- Circular Doubly Linked List - Insert a new node at the end
- Circular Doubly Linked List - Insert a new node at a given position
- Circular Doubly Linked List - Delete the first node
- Circular Doubly Linked List - Delete the last node
- Circular Doubly Linked List - Delete a node at a given position
- Circular Doubly Linked List - Delete all nodes
- Circular Doubly Linked List - Count nodes
- Circular Doubly Linked List - Delete even nodes
- Circular Doubly Linked List - Delete odd nodes
- Circular Doubly Linked List - Search an element
- Circular Doubly Linked List - Delete first node by key
- Circular Doubly Linked List - Delete last node by key
- Circular Doubly Linked List - Delete all nodes by key
- Circular Doubly Linked List - Reverse the List