Correct Answer: An optimal binary search tree has less average expected search time as compared with a general binary search tree's one.
Explanation:
Note: This Question is unanswered, help us to find answer for this one
More Compiler Design MCQ Questions