what is the different between B-tree and B+ tree.
- 8 Answers
- 41594 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
When is a graph said to be weakly connected?
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?
What are the two types of data?
Is hashset thread safe?
How does a selection sort work for an array?
How would you check if a binary tree is BST or not ? Write a program.
What is a list of lists?
What is sequential search?
Which data structure is used in arraylist?
Can we use ordered set for performing binary search?
Briefly explain recursive algorithm?
Describe tree database.
Which interfaces are implemented by printerstatereasons?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
