Answer the following statements true (T) or false (F)
1) 2-3 tree, each element is in its own node.
2) The root node of a 2-3 tree is always a 2-node.
3) Inserting an element into a 2-3 tree may add more than one node to the tree.
4) The easiest element to remove from a 2-3 tree is an element that is in a 3-node that is a leaf node.
5) A 2-4 tree extends the concept of a 2-3 tree by allowing a node to have 1, 2, or 3 elements and 0, 2, 3, or 4 children.
1) F
2) F
3) T
4) T
5) T
Computer Science & Information Technology