Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44463 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
Can you distinguish between ArrayList and Array?
Explain the implementation of an AVL tree and Binary tree.
What is the difference between hashset and treeset?
Define outdegree of a graph?
What is dynamic array with example?
What are different types of sorting techniques?
In tree construction which is the suitable efficient data structure?
Mention some drawbacks of the linked list.
How is hashmap o 1?
What is rule regarding overriding equals and hascode method?
What is the purpose of sorting?
Explain the uses of matrix with an example?
What is the difference between null and void?
What is the best complexity of bubble sort?
Can treemap key null?
