2-4 Trees

The number of comparisons for an unsuccessful search in a 2-4 tree is

O(log2⁡ n)

Build 2-4 tree using the input 1, 2, 9, 8, 5, 7, 10. How many 2-nodes are in this tree?

1

The height of a 2-4 tree with n input items in the internal nodes is the largest when all nodes are

2-node

How many external children does an internal node with two items have?

3-children

During the insertion operation in a 2-4 tree, an overflow could occur in a

4-node

The height of a 2-4 tree with n input items in the internal nodes is the smallest when all nodes are

4-node

Which statement about 2-4 trees is false?

To extract all items in sorted order from a 2-4 tree requires O(log2⁡ n) operations.