what is the different between B-tree and B+ tree.
- 8 Answers
- 41570 Views
- Syntel, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / baskerdearer
In B+ tree all the data present at the leaf node. so we can
easily access the data. In DBMS the table value stored by
B+ tree.
| Is This Answer Correct ? | 83 Yes | 8 No |
Answer / kamar rahi
In a B- tree you can store both keys and data in the
internal/leaf nodes. But in a B+ tree you have to store the
data in the leaf nodes only.
| Is This Answer Correct ? | 60 Yes | 6 No |
Answer / ranjit kumar singh
The demerit of B+ tree is that it takes more space but its advantage is that it is used by RDBMS for faster retrieval of data or record.
| Is This Answer Correct ? | 28 Yes | 10 No |
Answer / gajraj singh 8878250971
It's all about branching factor. Because of the way B+-Trees store records (called "satellite information") at the leaf level of the tree, they maximize the branching factor of the internal nodes. High branching factor allows for a tree of lower height. Lower tree height allows for less disk I/O. Less disk I/O theoretically means better performance
In a B- tree you can store both keys and data in the internal/leaf nodes. But in a B+ tree you have to store the data in the leaf nodes only.
A B+ - Tree is in the form of a balanced tree in which every path from the root of the tree to a leaf of the tree is the same length.
Each nonleaf node in the tree has between [n/2] and n children, where n is fixed.
B+ - Trees are good for searches, but cause some overhead issues in wasted space.
| Is This Answer Correct ? | 20 Yes | 4 No |
Answer / deependra rathode 9993072052
In a B-tree, pointers to data records exist at all levels of
the tree
In a B+-tree, all pointers to data records exists at the
leaf-level nodes
A B+-tree can have less levels (or higher capacity of search
values) than the corresponding B-tree
| Is This Answer Correct ? | 11 Yes | 3 No |
Answer / shivhar bhalerao
In B-tree more no of data pointer is required to store the
data and link of the data pointer ie. tree pointer so it
required more space accommodate in database.
But in B+ tree only leaf node is required to store data and
one link pointer so space is utilization is high as compare
to B tree ............
| Is This Answer Correct ? | 8 Yes | 2 No |
Answer / adithiya guru patham.v
In a B tree the insertion and deletion of the elements become more complex and also it occupies a large space when compared with the B + tree
| Is This Answer Correct ? | 6 Yes | 1 No |
Which is the parent class of linkedlist class?
Which is better hashmap or arraylist?
What do you mean by hash function?
Explain about the different lists available in the collection?
What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?
19 Answers ABB, SDE,
Why do we use trees in data structures?
how to add an item to the beginning of the list?
Why do we need searching algorithms?
create an singly linked lists and reverse the lists by interchanging the links and not the data?
What is inplace sorting?
what is a complexity of linear search,binery search?
Explain the Queue
Windows 
