Data Structures

Choose the correct description of Hash collision.

• A. A self-balancing tree data structure that maintains sorted data and allows searches, insertions, and deletions in logarithmic time, commonly used in databases.
• B. A collision resolution technique in hashing that searches sequentially for the next open slot in the table.
• C. A way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices.
• D. A situation in a hash table where two different keys produce the same hash value. ✓