We have a dictionary consisting of 500 words. If we use a binary tree as a spell-checker, how many checks might be required to test whether "tat" is a valid word?
A)7
B)8
C)9
D)10

Question

Quizplus · Accepted Answer

To find "tat" in a binary tree consisting of 500 words, we would need to traverse the tree from the root to the leaf node that contains the word "tat". Since a binary tree with 500 words has a depth of approximately 9 (log2(500)), we would need to make 9 checks to confirm whether "tat" is a valid word or not. Therefore, the correct answer is (C) 9.

We Have a Dictionary Consisting of 500 Words