COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Leaf node is split, when key B is inserted
|
|
|
Leaf node is split, when key G is inserted
|
|
|
Leaf node is split, and B goes to root node
|
|
|
Leaf node is split, and G goes to root node
|
Detailed explanation-1: -A B-Tree is a special kind of tree in a data structure. In 1972, this method was first introduced by McCreight, and Bayer named it Height Balanced m-way Search Tree. It helps you to preserves data sorted and allowed various operations like Insertion, searching, and deletion in less time.
Detailed explanation-2: -Properties of B-Tree The number of keys in the root ranges from one to (m-1) maximum. Therefore, root has a minimum of two and a maximum of m children. The keys range from min([m/2]-1) to max(m-1) for all nodes (non-leaf nodes) besides the root. Thus, they can have between m and [m/2] children.
Detailed explanation-3: -Deleting an element on a B-tree consists of three main events: searching the node where the key to be deleted exists, deleting the key and balancing the tree if required. While deleting a tree, a condition called underflow may occur.