Answer the following statements true (T) or false (F)

1. A 2-3 is pretty much the same as a binary tree.
2. A 2-3 tree is never taller than a minimum-height binary tree.
3. The leaf of a 2-3 tree must contain exactly 2 data items.
4. Searching a 2-3 tree is efficient.
5. Searching a 2-3 tree is more efficient than searching a binary search tree.

1. False
2. True
3. False
4. True
5. False