Awesome q2a theme
0 votes
Suppose we have a B-tree 3 nodes with room for 3 keys and 4 pointers. suppose also that when we split a leaf, we divide the pointers 2 and 2. while when we split and interior node, the first three pointers go with the first node(left node), and the last two pointers go with the second node(right node). we start with the leaf containing pointers to record with keys  1 2 and 3. we then add in order, record with the keys 4,5,6 and so on. At the insertion of what key will the B tree first reach four levels???




in Databases by (133 points) | 19 views
@gatecse @shaik sir @srestha sir

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
8,446 questions
2,720 answers
95,469 users