Discussion
A binary search tree implementation of a symbol table gives average lookup cost
Answer: C
Correct answer: logarithmic in the number of entries
A balanced tree halves the search space at each step, giving \( O(\log n) \) lookup, and it keeps the entries in order - useful for producing a sorted listing. A hash table is faster still, at constant average cost, but loses the ordering.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development