1.

Does (2, 4) tree storing a set of entries will always have the same structure regardless of the order in which the entries are inserted?

Answer»

No. ONE property of a (2, 4) tree is that all external nodes are at the same DEPTH. The multi-way search tree of the example does not adhere to this property. Your classmate claims that a (2,4) tree STORING a set of entries will always have the same structure, regardless of the ORDER in which the entries are inserted...



Discussion

No Comment Found