Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44233 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
Is pointer a variable?
What are the major data structures used in the rdbms?
How do you represent a linked list?
Which is best array or linked list?
Why is hashset used?
Explain implementation of traversal of a binary tree.
Which is better stack or queue?
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
What are different types of algorithms?
What is breadth first tree?
What is vector and types of vector?
Can arraylist shrink?
What is data type in data structure?
How efficient is binary search?
Why sorting is used?
