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.
Which blood group is the universal recipient?
A positively charged particle enters a uniform electric field directed downward. The force acting on the particle is:
What is the focal length of a plane mirror?
In Bernoulli's principle, increase in fluid velocity leads to:
A fish is at a depth d below the surface of a water tank. A cat observes the fish from air. Due to refraction at water-air interface, the apparent depth...
Biogas which is used for cooking purpose is a mixture of which of the following two components?
Which of the following statements about holes is incorrect ?
Which of the following reproduces using fission?
Which of the following correctly represents the order of increasing wavelength?
A heating element using nichrome connected to a 230 V supply draws an initial current of 3.2 A which settles after a few seconds to a steady value of 2....