Which Statement Is False

question 49

Multiple Choice

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.