Test
3. 2-3 Tree
Crea una cuenta gratis para terminar este test
Guarda tu progreso y consulta tu resultado final.
¿Ya tienes cuenta? Inicia sesión
Preguntas del test (19)
1What are the internal node stipulations in a 2-3 tree?
- AThe internal node must have one data item and two children or two data items and three children.
- Bnone of the above
2An internal node in a 2-3 tree is said to be a _ node if it has
two data elements and ___ children.- AA) 2, 2
- BB) 3, 2
- CC) 3, 3
- DD) 2, 3
3What makes a 2-3 tree seperate from a binary tree?
- AEach node can have up to two elements and three children.
- Bnone of the above
4all leaves in a 2-3 tree are at the same level?
- AVerdadero
- BFalso
5What is the lookup time for 2-3 Tree?
- AA.nlogn
- BB.log M(where m is the numbr of keys)
- CC.n
- DD.None of the above
6What time for searching does a 2-3 tree gurantee?
- AO(log n)
- BO(n^2)
7The worst possible case for the binary tree is that all of the data is entered in order.
- AVerdadero
- BFalso
8In a 2-3 tree a node that has two values must be?
- AA. only a leaf node
- BB. only a node with 3 children
- CC. either a leaf node or a node with 3 children
9Which of the following is false about 2-3 trees?
- Aa. Every internal node is a 2-node or a 3-node.
- Bb. Leaves are not at the same level.
- Cc. All data is kept in sorted order.
- Dd. None of the above
10What is the maximum number of children a 2-3 tree can have?
- AA) 3
- BB) 2
- CC) 6
- DD) There is no limit
11In 2-3 tree, every node with children has ____ and ____.
- Aa. 2 children and 1 data element; 3 children and 2 data elements
- Bb. Only 2 children and 1 data element
- Cc. Only 3 data elements and 2 children
- Dd. 3 children and 1 or 2 data elements
12A 2-3 tree can have:
- AA. Two children and one data element
- BB. Three children and two data elements
- CC. One child and one data element
- DD. A and B
13What is a 2-3 tree?
- AA) A tree with only 2/3 available
- BB) A tree where every child has either two children or three children
- CC) A tree with height only 2 or 3
- DD) None of the above
14When inserting into a non-root node which has 2 keys already in a 2-3 tree, which of the following will happen first?
- AA. nothing; 2-3 trees can hold 3 keys per node
- BB. the smallest value gets pushed up to the parent
- CC. the middle value gets pushed up to the parent
- DD. the largest value gets pushed up to the parent
15A 2-3 Tree is a specific form of a B tree. A 2-3 tree is a:
- AA. value tree
- BB. search tree
- CC. node tree
- DD. left tree
16When talking about a 2-3 tree the right, center, left subtree contains the same or close to same amount of data. If this is true what is this tree considered to be?
- AA) close
- BB) balanced
- CC) un-balanced
- DD) The first statement is no true
17Which is not correct the following properties of 2-3 tree?
- Aa. Every internal node is a 2-node or a 3-node.
- Bb. All leaves are at the same level.
- Cc. All data is kept in sorted order.
- Dd. All leaves are at the different level.
18which one is not right about the 2_3 tree?
- AA. A 2_3 tree is a binary search tree.
- BB. In the average case, the time complexity of searching one member of the 2_3 tree is O(logn).
- CC. In the average case, the time complexity of inserting one member into the 2_3 tree is O(logn).
- DD. a B-tree of order 3 is a 2-3 tree.
19What is the worst case time complexity of delete in a 2-3 tree? (In big O notation)
- AA) O(log(2N))
- BB) O(N)
- CC) O(log(N))
- DD) O(e^(N+1))
Información
- Descripción
- Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
- Autor
- Mena Sargios
- Idioma
- English
- Visitas
- 488
- Etiquetas
- Valoración
- Aún sin valoraciones Valora este test