Register
Dark Mode

Gate 2019: B+ Tree

in Databases
3,217 views
2 votes
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
in Databases
by
3.2k views

1 comment

by
0
0

2 Answers

4 votes
4 votes
d is incorrect statement.In B+ tree all the data records are in leaf , that is the main difference b/w B+ Tree ane B tree
by
1 vote
1 vote
Answer should be D
by
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
3
aditi19 asked in Databases Nov 23, 2018
410 views
B+ Trees
can anyone share some good resources fot B+ tree deletion?
aditi19 asked in Databases Nov 23, 2018
by aditi19
410 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!