Data Structures Data Structures 2

Question 1

What is the worst-case time complexity of searching for an element in a balanced binary search tree with n nodes?

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(1)

Answer

O(n log n)

Question 2

Which data structure uses the Last-In-First-Out (LIFO) principle?

Accepted Answer

Stack

Answer

Queue

Answer

Linked list

Answer

Hash table

Question 3

In a singly linked list, what does the last node's next pointer typically reference?

Accepted Answer

Null

Answer

The head node

Answer

The previous node

Answer

Itself

Question 4

Which of the following operations is most efficient on an array compared to a linked list?

Accepted Answer

Random access by index

Answer

Insertion at the front

Answer

Deletion at the front

Answer

Dynamic resizing

Question 5

What happens when two keys hash to the same index in a hash table using chaining?

Accepted Answer

Both entries are stored in a linked list at that index

Answer

The second key overwrites the first

Answer

The table is immediately resized

Answer

The second key is rejected

Question 6

Which traversal of a binary search tree visits nodes in ascending sorted order?

Accepted Answer

In-order

Answer

Pre-order

Answer

Post-order

Answer

Level-order

Question 7

What is the time complexity of enqueue and dequeue operations in a queue implemented with a linked list that tracks both head and tail?

Accepted Answer

O(1) for both

Answer

O(n) for both

Answer

O(1) enqueue, O(n) dequeue

Answer

O(n) enqueue, O(1) dequeue