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, 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 loosely packed trees.

Question

Quizplus · Accepted Answer

In a loosely packed binary tree, searching can be inefficient because the tree may not be balanced, leading to longer paths and more comparisons.

Which Statement Is False