4. 2-3-4 Tree

If the internal node has one data item in it, then it only has two children if the internal node has two data items in it, then it has three children if the internal node has three data items in it, then it has four children

none of the above

A) 2, 2

B) 3, 2

C) 3, 4

D) 4, 4

Each node can have up to three elements and four children.

none of the above

A.how many links to child nodes can potentially be contained in a given node

B.how many searches must be done find element of the tree

C.none of the above

D.A and B

Dictionaries

none of the above

a. a 2-node has TWO data elements and TWO child nodes.

b. a 3-node has TWO data elements and THREE child nodes.

c. a 4-node has THREE data elements and THREE child nodes.

d. None are true!

A) There is no maximum

B) 9

C) 2

D) 4

2-3-4 tree

none of the above

A. 2 3 or 4

B. 1 2 or 3

C. 4 5 or 6

D. 2 4 or 6

A) All external nodes are at the same depth

B) The trees have height 2, 3, or 4

C) They are A-Trees

D) None

A. all leaves are on the same level

B. each node has 2 keys with 3 children, and every tree is log 4 for searching

C. has 3 or 4 keys per node

D. each node can have any number of children, but only 2, 3, or 4 keys per node

A. Every node (leaf or internal) is a 2-node, 3-node or a 4-node, and holds one, two, or three data elements, respectively.

B. All leaves are at the same depth (the bottom level).

C. All data is kept in sorted order.

D. All of the above

a. Every node (leaf or internal) is a 2-node, 3-node or a 4-node, and holds one, two, or three data elements, respectively.

b. All leaves are at the same depth (the bottom level).

c. All data is kept in sorted order.

d. All data is not kept in any certain sorted order.

A. one node in a 2_3_4 tree must has 4 child nodes.

B. In the average case, the time complexity of searching one member of the 2_3_4 tree is O(logn).

C. In the average case, the time complexity of inserting one member into the 2_3_4 tree is O(logn).

D. 2–3–4 trees are B-trees of order 4.

A) O(Log(N+1))

B) O(Log(N-1))

C) O(Log(N/2))

D) O(Log(N))