3. Algorithms and Problem Solving
Searching Techniques — Quiz
Test your understanding of searching techniques with 5 practice questions.
Practice Questions
Question 1
What is the average-case time complexity of searching for an element in a perfectly balanced binary search tree (BST) with $n$ nodes?
Question 2
In a binary search tree (BST), what is the time complexity of deleting an element in the worst case if the tree is unbalanced and skewed?
Question 3
Which of the following best describes the number of comparisons made by a binary search on a sorted array of $2^{10}$ elements in the worst case?
Question 4
What is the time complexity of finding the maximum element in a binary search tree (BST)?
Question 5
Consider a binary search tree (BST) where each node stores the size of its subtree (i.e., the number of nodes in that subtree). What is the time complexity of finding the $k$-th smallest element in the tree?