Question

Given below are two statements: one is labelled as Assertion (A) and the other is labelled as Reason (R). Assertion (A): The binary search tree property allows us to perform efficient search.
Reason (R): In a sorted tree, values are arranged such that left subtree has smaller values and right subtree has greater values.
Choose the correct answer from the options given below:

• A. Both (A) and (R) are correct and (R) is the correct explanation of (A)
• B. Both (A) and (R) are correct but (R) is not the correct explanation of (A)
• C. (A) is correct but (R) is not correct
• D. (A) is not correct but (R) is correct

Hint:

BST efficiency comes from its ordered structure, similar to binary search.

Answer 1

The Correct Option is A

Concept: Binary Search Tree (BST) follows an ordered structure.

Step 1: Analyze Assertion (A)
• BST enables efficient searching
• Time complexity: \(O(\log n)\) (average case) ✔ Assertion is correct.

Step 2: Analyze Reason (R)
• Left subtree → smaller values
• Right subtree → greater values ✔ Reason is correct.

Step 3: Check explanation
• Ordered structure allows binary search-like traversal
• This is why search is efficient ✔ Reason explains Assertion.

Step 4: Final answer \[ \boxed{(1)} \]