Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44789 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
Define a path in a tree?
how to insert a new node in linked list where free node will be available?
What is mean by sorting?
How many pointers are necessary to implement a simple linked list?
How do you implement a stack?
How do you sort in ascending order in arraylist?
Are duplicates allowed in hashmap?
A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
Does arraylist shrink?
Why use a tuple instead of a list?
Tell me how to find middle element of linked list in one pass?
Explain implementation of traversal of a binary tree.
For searches. Which one is most preferred: array list or linked list?
Are hash tables ordered?
Does treeset allow duplicates?
