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
You might also like to view...
Select all that apply. While traversing a list, a node pointer knows when it has reached the end of the list if
a. it encounters the newline character b. it encounters a null pointer c. it finds itself back at the beginning of the list d. it encounters a sentinel such as 9999
Which of the following is not one of the main components of UML?
A) things B) relationships C) entities D) diagrams
What are some considerations for icon design?
What will be an ideal response?
From a security standpoint, how do switches increase the relative protection of networking communications?
What will be an ideal response?