Which statement is false?
A)In a tightly packed binary tree,each level contains about twice as many elements as the previous level.
B)When searching a tightly packed 1,000,000-element binary search tree,a maximum of approximately 40 comparisons needs to be made.
C)The level-order traversal of a binary tree visits the nodes of the tree row-by-row starting at the root node level.
D)Searching a binary tree for a value that matches a key value is slow for loosely packed trees compared to tightly packed trees.

Question

Quizplus · Accepted Answer

In a tightly packed binary search tree, the maximum number of comparisons needed to search for a value is approximately equal to the height of the tree. For a 1,000,000-element tree, the height would be log2(1000000) ≈ 20, and thus, the maximum number of comparisons needed would be 20, not 40. Therefore, statement B is false.

Which Statement Is False