Start learning 50% faster. Sign in now
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(logn). 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.
Shafali Verma became the fastest woman to score a double century in Test cricket against which team?
Which malaria vaccine developed by Oxford University and manufactured by Serum Institute of India has been added to the WHO's list of prequalified vacci...
Which renewable energy projects will power the Noida International Airport?
Recently which of the following public sector bank has signed a 150-million-euro (Rs 1,240 crore) loan agreement with the German development bank KfW fo...
The Shilp Didi Programme targets how many female artisans across India?
How much did gold imports drop in December 2024 compared to November 2024?
On which date International Childhood Cancer Day is observed annually?
Which political figure unveiled the new multi-colored logo for the Maha Kumbh Mela 2025 in Prayagraj?
What is the name of the first submarine base commissioned by Bangladesh?