tech quiz

Q1. Which data structure is most suitable for implementing recursion?

• A) Queue

• B) Array

• C) Stack

• D) Linked List

Q2. What is the worst-case time complexity to search an element in a balanced binary search tree?

• A) O(n)

• B) O(log n)

• C) O(1)

• D) O(n log n)

Q3. A priority queue can be efficiently implemented using:

• A) Circular queue

• B) Binary heap

• C) Hash table

• D) Linked list

Q4. In an AVL tree, what is the maximum difference between the heights of the left and right subtrees of any node?

• A) 2

• B) 1

• C) log n

• D) n

Q5. Which traversal of a binary search tree gives the nodes in sorted order?

• A) Pre-order

• B) Post-order

• C) In-order

• D) Level-orde