What is wrong about the B-Tree description used by Mysql index?
A. Each non-leaf node consists of n-1 keys and n pointers, where d <= n <= 2d;
B. Each leaf node contains at least one key and two pointers
C. All leaf nodes are on the same layer and the depth is equal to the tree height h.
D. The keys in a node are descending from left to right.
Answer:D
What is wrong about the B-Tree description used by Mysql index?
A. Each non-leaf node consists of n-1 keys and n pointers, where d <= n <= 2d; B. Each leaf node contains at least one key and two pointers C. All leaf nodes are on the same layer and the depth is equal to the tree height h. D. The keys in a node are descending from left to right.