A spell-checker is using a binary tree. If the size of the dictionary doubles, what will be the increase in the number of required checks?
A)1
B)2
C)3
D)4

Question

Quizplus · Accepted Answer

In a binary tree, the number of checks required to find a word is proportional to the height of the tree. Doubling the size of the dictionary increases the height of the tree by 1, hence only 1 additional check is needed.

A Spell-Checker Is Using a Binary Tree