Worksheetstech quiz
Total questions: 5
Worksheet time: 2mins
Name
Class
Date
1.
Q1. Which data structure is most suitable for implementing recursion?
a)
A) Queue
b)
B) Array
c)
C) Stack
d)
D) Linked List
2.
Q2. What is the worst-case time complexity to search an element in a balanced binary search tree?
a)
A) O(n)
b)
B) O(log n)
c)
C) O(1)
d)
D) O(n log n)
3.
Q3. A priority queue can be efficiently implemented using:
a)
A) Circular queue
b)
B) Binary heap
c)
C) Hash table
d)
D) Linked list
4.
Q4. In an AVL tree, what is the maximum difference between the heights of the left and right subtrees of any node?
a)
A) 2
b)
B) 1
c)
C) log n
d)
D) n
5.
Q5. Which traversal of a binary search tree gives the nodes in sorted order?
a)
A) Pre-order
b)
B) Post-order
c)
C) In-order
d)
D) Level-orde
100 %
