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 20 comparisons need 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 tightly packed trees.

Question

Quizplus · Accepted Answer

Searching a binary tree for a value that matches a key value is actually faster for tightly packed trees as the search can be done in O(log n) time. Therefore, statement D is false. The other statements are true. Statement A is a characteristic of a complete binary tree, statement B follows from the fact that the height of a binary search tree is log2(n), and statement C describes the level-order traversal algorithm.

Which Statement Is False