Q41Section DA (Data Science and Artificial Intelligence (Q11–Q65))41 of 65
Root key(s) after an insertion that splits a B+ tree leaf
Consider a B+ Tree where the maximum number of key values in each leaf node is 2 and the maximum number of pointers in each non-leaf node is 3. Let the content of the B+ Tree be as shown in the figure. Which of the following options denotes the key value(s) stored in the root node after inserting a key value 3 in the given B+ Tree?
Pick an option to check your answer. In a mock test a wrong answer here costs 2/3 mark.