Binary Search Tree and Hashing Quiz

What is the time complexity of searching an element in a balanced Binary Search Tree?

• O(n)

• O(log n)

• O(n log n)

• O(1)

Which traversal of a BST results in a sorted order of elements?

• Preorder

• Inorder

• Postorder

• Level order

In a BST, what is the time complexity of inserting an element in the worst case?

• O(log n)

• O(n)

• O(1)

• O(n²)

Which of the following properties is not true for a Binary Search Tree?

• All left descendants ≤ node

• All right descendants > node

• No duplicate nodes

• All nodes must be balanced

Deleting a node with two children in a BST involves:

• Deleting the root

• Replacing it with its immediate child

• Replacing it with its inorder predecessor or successor

• Rebuilding the entire tree

Which of the following is not a collision resolution technique?

• Chaining

• Open Addressing

• Linear Probing

• Binary Search

What is the primary goal of a good hash function?

• Avoid deletion

• Minimize collisions

• Use complex arithmetic

• Increase search time

In linear probing, if the hash table is full, what happens on insertion?

• Inserts at the last position

• Overwrites the value

• Insertion fails

• Searches for next table

Which of the following statements is true about load factor (α)?

• α = size of hash table

• α = number of probes

• α = number of elements / size of table

• α = key / value ratio

In double hashing, the second hash function should:

• Be constant

• Depend only on the key

• Always return even number

• Be equal to the first hash function