Database-Management-System
August 21, 2024Database-Management-System
| Question 41 |
Consider the B+ tree in the adjoining figure, where each node has atmost two keys and three links.
Keys K15 and then K25 are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions?
| 1 | |
| 2 | |
| 3 | |
| 4 |
Question 41 Explanation:
It is B+ Tree.
After inserting K15 we get,
Now, we insert K25, which gives
So, we see in the final tree only (K20, K25) is present. Hence, 1 (Answer).
After inserting K15 we get,
Now, we insert K25, which gives
So, we see in the final tree only (K20, K25) is present. Hence, 1 (Answer).
Correct Answer: A
Question 41 Explanation:
It is B+ Tree.
After inserting K15 we get,
Now, we insert K25, which gives
So, we see in the final tree only (K20, K25) is present. Hence, 1 (Answer).
After inserting K15 we get,
Now, we insert K25, which gives
So, we see in the final tree only (K20, K25) is present. Hence, 1 (Answer).
Subscribe
Login
0 Comments