Quiz
4. 2-3-4 Tree
Erstelle ein kostenloses Konto, um dieses Quiz zu beenden
Speichere deinen Fortschritt und sieh dir dein Endergebnis an.
oder mit deiner E-Mail registrieren
Schon ein Konto? Anmelden
Fragen in diesem Quiz (18)
1What are the internal node stipulations in a 2-3-4 tree?
- AIf 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 - Bnone of the above
- AIf the internal node has one data item in it, then it only has two children
2An internal node in a 2-3-4 tree is said to be a _ node if it has
_ data elements.- AA) 2, 2
- BB) 3, 2
- CC) 3, 4
- DD) 4, 4
3What makes a 2-3-4 tree seperate from a binary tree?
- AEach node can have up to three elements and four children.
- Bnone of the above
4What does the 2,3,4 in a 2-3-4 tree mean
- AA.how many links to child nodes can potentially be contained in a given node
- BB.how many searches must be done find element of the tree
- CC.none of the above
- DD.A and B
5What are 2-3-4 tree's commonly used to implement?
- ADictionaries
- Bnone of the above
6a 2–3–4 tree is a self-balancing data structure that is commonly used to implement dictionaries.
- ARichtig
- BFalsch
7in a 2-3-4 tree a node can have up to 4 children?
- ARichtig
- BFalsch
8Which of the following is true of 2-3-4 trees?
- Aa. a 2-node has TWO data elements and TWO child nodes.
- Bb. a 3-node has TWO data elements and THREE child nodes.
- Cc. a 4-node has THREE data elements and THREE child nodes.
- Dd. None are true!
9What is the maximum number of children in a 2-3-4 tree?
- AA) There is no maximum
- BB) 9
- CC) 2
- DD) 4
10A tree where every node with children has either 2, 3, or 4 children:
- A2-3-4 tree
- Bnone of the above
11A 2-3-4 tree is a tree where every node with children has ________ child nodes.
- AA. 2 3 or 4
- BB. 1 2 or 3
- CC. 4 5 or 6
- DD. 2 4 or 6
12What is one proerty of 2-3-4 trees?
- AA) All external nodes are at the same depth
- BB) The trees have height 2, 3, or 4
- CC) They are A-Trees
- DD) None
13Which of the following is a characteristic of a 2-3-4 tree?
- AA. all leaves are on the same level
- BB. each node has 2 keys with 3 children, and every tree is log 4 for searching
- CC. has 3 or 4 keys per node
- DD. each node can have any number of children, but only 2, 3, or 4 keys per node
14What are the properties of a 2-3-4 tree?
- AA. Every node (leaf or internal) is a 2-node, 3-node or a 4-node, and holds one, two, or three data elements, respectively.
- BB. All leaves are at the same depth (the bottom level).
- CC. All data is kept in sorted order.
- DD. All of the above
152-3-4 trees are an isometry of red-black trees.
- ARichtig
- BFalsch
16In computer science, a 2–3–4 tree (also called a 2–4 tree) is a self-balancing data structure that is commonly used to implement dictionaries.
which is not correct the following properties of 2-3-4 tree?- Aa. Every node (leaf or internal) is a 2-node, 3-node or a 4-node, and holds one, two, or three data elements, respectively.
- Bb. All leaves are at the same depth (the bottom level).
- Cc. All data is kept in sorted order.
- Dd. All data is not kept in any certain sorted order.
17which one is not right about the 2_3_4 tree?
- AA. one node in a 2_3_4 tree must has 4 child nodes.
- BB. In the average case, the time complexity of searching one member of the 2_3_4 tree is O(logn).
- CC. In the average case, the time complexity of inserting one member into the 2_3_4 tree is O(logn).
- DD. 2–3–4 trees are B-trees of order 4.
18In big O notation, what is the worst case time complexity for inserting a node into a 2-3-4 tree?
- AA) O(Log(N+1))
- BB) O(Log(N-1))
- CC) O(Log(N/2))
- DD) O(Log(N))
Informationen
- Beschreibung
- Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
- Autor
- Mena Sargios
- Sprache
- English
- Aufrufe
- 426
- Schlagwörter
- Bewertung
- Noch keine Bewertungen Bewerte dieses Quiz