Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44523 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
Why do we Use a Multidimensional Array?
which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?
What is a concurrenthashmap?
What do you mean by selection sort?
Can we search the data in a linked list?
Which time complexity is best?
Explain binary search tree?
What is quick sort?
Do you know what is linear search?
What is comparator interface used for?
Advanced problems related to Data Structures were asked
What is the need of sorting?
Why do we need to use computers to help us sort lists?
State the properties of a binary tree?
What is the difference between Array and Arraylist?
