What are the internal node stipulations in a 2-3 tree?
The internal node must have one data item and two children or two data items and three children.
none of the above
An internal node in a 2-3 tree is said to be a _ node if it has two data elements and ___ children.
A) 2, 2
B) 3, 2
C) 3, 3
D) 2, 3
What makes a 2-3 tree seperate from a binary tree?
Each node can have up to two elements and three children.
all leaves in a 2-3 tree are at the same level?
What is the lookup time for 2-3 Tree?
A.nlogn
B.log M(where m is the numbr of keys)
C.n
D.None of the above
What time for searching does a 2-3 tree gurantee?
O(log n)
O(n^2)
The worst possible case for the binary tree is that all of the data is entered in order.
In a 2-3 tree a node that has two values must be?
A. only a leaf node
B. only a node with 3 children
C. either a leaf node or a node with 3 children
Which of the following is false about 2-3 trees?
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
What is the maximum number of children a 2-3 tree can have?
A) 3
B) 2
C) 6
D) There is no limit
In 2-3 tree, every node with children has ____ and ____.
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
A 2-3 tree can have:
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
What is a 2-3 tree?
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
When inserting into a non-root node which has 2 keys already in a 2-3 tree, which of the following will happen first?
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
A 2-3 Tree is a specific form of a B tree. A 2-3 tree is a:
A. value tree
B. search tree
C. node tree
D. left tree
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?
A) close
B) balanced
C) un-balanced
D) The first statement is no true
Which is not correct the following properties of 2-3 tree?
b. All leaves are at the same level.
d. All leaves are at the different level.
which one is not right about the 2_3 tree?
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.
What is the worst case time complexity of delete in a 2-3 tree? (In big O notation)
A) O(log(2N))
B) O(N)
C) O(log(N))
D) O(e^(N+1))
