New Register for Workshop on How to start for NABARD 2025 (Stepwise Plan) - Apr 26, 7 PM

    Question

    Which searching algorithm is most suitable for a

    balanced binary search tree (BST) when the goal is minimal comparison?
    A Linear Search Correct Answer Incorrect Answer
    B Binary Search Correct Answer Incorrect Answer
    C Depth-First Search Correct Answer Incorrect Answer
    D Breadth-First Search Correct Answer Incorrect Answer
    E Exponential Search Correct Answer Incorrect Answer

    Solution

    In a balanced BST, keys are arranged such that for any node, the left subtree contains keys smaller than the node, and the right subtree contains keys larger than the node. This structure allows Binary Search to perform efficiently, as it eliminates half the search space with each comparison, achieving a time complexity of O(log⁡n). The minimal comparisons and logical traversal make Binary Search optimal for balanced trees. Why Other Options are Incorrect: 1. Linear Search: Linear search checks each node one by one, resulting in O(n) complexity, making it highly inefficient for large datasets. 2. Depth-First Search: DFS explores nodes depth-wise, which is not directly suitable for searching in a sorted structure like BST. 3. Breadth-First Search: BFS examines nodes level-wise, increasing overhead compared to Binary Search in BST. 4. Exponential Search: This method is better suited for arrays rather than tree structures, especially when data sizes are unknown or unbounded.

    Practice Next