Register

Gate 2019: B+ Tree

3,710 views
2 2 votes
Which of the following is not correct about B + Tree, which is used for creating index
of relational database table?
(a) Key values in each node kept in sorted order
(b) Leaf node pointer points to next node
(c) B + tree is height balanced tree
(d) Non-leaf node have pointers to data records

2 Answers

Voting & Accepting an answer helps improve the community
← Previous · gate 2019Next → · Gate cse 2109
← Previous in category · gate 2019Next in category → · GATE2019
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.3k
1.3k views
Prince Sindhiya asked Jan 2, 2019
1,336 views
Zeal Test Series 2019: Programming & DS - Binary Tree
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
1 1 vote
2 2 answers
2.0k
2.0k views
CHïntän ÞäTël asked Dec 10, 2018
2,036 views
MadeEasy Subject Test 2019: Programming & DS - Binary Tree
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
0 0 votes
1 1 answer
381
381 views
SandeepKumar147 asked Apr 25, 2024
381 views
B tree dbms
0 0 votes
1 1 answer
1.3k
1.3k views
qweas8671 asked Jul 2, 2022
1,324 views
For which of the following does there exist a tree satisfying the specified constraints? (a) A binary tree with 65 leaves and height 6. (b) A binary tree with 33 leaves and height 5.