1. A 2-3-4 tree is so named because a node can have

a. Three children and four data items

b. Two, three, or four children

c. Two parents, three children, four data items

d. Two parents, three items, four children

2. In a balanced tree,

a. The tree may need to be restructured during searches

b. The paths from the root to the leaf nodes are about the same length

c. All left subtrees are the same height as all right subtrees

d. The high of all subtrees is closely controlled

3. A balanced binary search tree is desirable because it avoids slow search performance when data has been inserted _________.

a. in order

b. out of order

c. with alternating high and low values

d. with alternating odd and even values

e. randomly

4. When implementing a binary tree on an array -- if the root is at index 1 -- what is the index of the right child of a node at location x?

a. x / 2

b. 2 * X

c. 2 * X +1

d. 2 * x + 2

5. A heap can be efficiently represented by an array because a heap __________

a. is complete

b. is weakly ordered

c. is a binary tree

d. can be used to implement a priority queue

6. When you add a new node to a heap, it is initially added ________

a. as a left child

b. as a right child

c. at the root

d. in the bottom or last row