Data structures

123456789101112
Across
  1. 2. (8) - A data structure that efficiently stores key-value pairs.
  2. 6. (6) - A collection of unique elements, unordered and without duplicates.
  3. 8. (9) - A data structure that allows for efficient insertion, deletion, and searching at any position.
  4. 9. (6) - A linear data structure where elements are added and removed from the back (Incorrect - A linear data structure where elements are added and removed from the top.)
  5. 10. (5) - A linear data structure that follows a First In First Out (FIFO) principle.
  6. 12. (7) - A self-balancing binary search tree.
Down
  1. 1. (7) - A data structure that allows searching and sorting of elements in logarithmic time.
  2. 3. (8) - A dynamic array that resizes automatically to avoid overflow.
  3. 4. (3) - A linear data structure that follows a Last In First Out (LIFO) principle.
  4. 5. (3) - A data structure that efficiently implements a queue (Incorrect - A data structure that follows a Last In First Out (LIFO) principle.)
  5. 7. (9) - A non-linear data structure that stores data in a hierarchical fashion.
  6. 11. (8) - A linear data structure where elements are added or removed from the beginning or end.