Select the incorrect statement. Binary search trees (regardless of the order in which the values are inserted into the tree):
A) Always have multiple links per node.
B) Can be sorted efficiently.
C) Always have the same shape for a particular set of data.
D) Are nonlinear data structures.

Question

Quizplus · Accepted Answer

Binary search trees do not always have the same shape for a particular set of data; their structure can vary significantly depending on the order in which values are inserted.

Select the Incorrect Statement