7128225
Description
Quiz by Mena Sargios, updated more than 1 year ago
|
Created by Mena Sargios
over 7 years ago
|
|
Question 1
Question
What are the internal node stipulations in a 2-3 tree?
Answer
-
The internal node must have one data item and two children or two data items and three children.
-
none of the above
Question 2
Question
An internal node in a 2-3 tree is said to be a _ node if it has
two data elements and ___ children.
Answer
-
A) 2, 2
-
B) 3, 2
-
C) 3, 3
-
D) 2, 3
Question 3
Question
What makes a 2-3 tree seperate from a binary tree?
Answer
-
Each node can have up to two elements and three children.
-
none of the above
Question 4
Question
all leaves in a 2-3 tree are at the same level?
Answer
- True
- False
Question 5
Question
What is the lookup time for 2-3 Tree?
Answer
-
A.nlogn
-
B.log M(where m is the numbr of keys)
-
C.n
-
D.None of the above
Question 6
Question
What time for searching does a 2-3 tree gurantee?
Answer
-
O(log n)
-
O(n^2)
Question 7
Question
The worst possible case for the binary tree is that all of the data is entered in order.
Answer
- True
- False
Question 8
Question
In a 2-3 tree a node that has two values must be?
Answer
-
A. only a leaf node
-
B. only a node with 3 children
-
C. either a leaf node or a node with 3 children
Question 9
Question
Which of the following is false about 2-3 trees?
Answer
-
a. Every internal node is a 2-node or a 3-node.
-
b. Leaves are not at the same level.
-
c. All data is kept in sorted order.
-
d. None of the above
Question 10
Question
What is the maximum number of children a 2-3 tree can have?
Answer
-
A) 3
-
B) 2
-
C) 6
-
D) There is no limit
Question 11
Question
In 2-3 tree, every node with children has ____ and ____.
Answer
-
a. 2 children and 1 data element; 3 children and 2 data elements
-
b. Only 2 children and 1 data element
-
c. Only 3 data elements and 2 children
-
d. 3 children and 1 or 2 data elements
Question 12
Question
A 2-3 tree can have:
Answer
-
A. Two children and one data element
-
B. Three children and two data elements
-
C. One child and one data element
-
D. A and B
Question 13
Question
What is a 2-3 tree?
Answer
-
A) A tree with only 2/3 available
-
B) A tree where every child has either two children or three children
-
C) A tree with height only 2 or 3
-
D) None of the above
Question 14
Question
When inserting into a non-root node which has 2 keys already in a 2-3 tree, which of the following will happen first?
Answer
-
A. nothing; 2-3 trees can hold 3 keys per node
-
B. the smallest value gets pushed up to the parent
-
C. the middle value gets pushed up to the parent
-
D. the largest value gets pushed up to the parent
Question 15
Question
A 2-3 Tree is a specific form of a B tree. A 2-3 tree is a:
Answer
-
A. value tree
-
B. search tree
-
C. node tree
-
D. left tree
Question 16
Question
When 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?
Answer
-
A) close
-
B) balanced
-
C) un-balanced
-
D) The first statement is no true
Question 17
Question
Which is not correct the following properties of 2-3 tree?
Answer
-
a. Every internal node is a 2-node or a 3-node.
-
b. All leaves are at the same level.
-
c. All data is kept in sorted order.
-
d. All leaves are at the different level.
Question 18
Question
which one is not right about the 2_3 tree?
Answer
-
A. A 2_3 tree is a binary search tree.
-
B. In the average case, the time complexity of searching one member of the 2_3 tree is O(logn).
-
C. In the average case, the time complexity of inserting one member into the 2_3 tree is O(logn).
-
D. a B-tree of order 3 is a 2-3 tree.
Question 19
Question
What is the worst case time complexity of delete in a 2-3 tree? (In big O notation)
Answer
-
A) O(log(2N))
-
B) O(N)
-
C) O(log(N))
-
D) O(e^(N+1))
Want to create your own Quizzes for free with GoConqr? Learn more.