what is the different between B-tree and B+ tree.
- 8 Answers
- 42069 Views
- Syntel, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
How do stacks work?
How to use appendNode() in linkedlist()?
What is the difference between file structure and storage structure?
What is the need of sorting?
How can you implement a stack?
What will you prefer for traversing through a list of elements between singly and doubly linked lists?
Can treemap have null values?
What is the application of queue?
What is a B tree?
What is the best case for bubble sort?
write an algorithm to show the procedure of insertion into a b-tree?
Explain Array
What is concept of data structure?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
What are the major data structures used in the following areas : network data model & hierarchical data model?
