In a B tree the insertion and deletion of the elements become more complex

what is the different between B-tree and B+ tree.

Question Posted / adithiya guru patham.v

Answer Posted / adithiya guru patham.v

In a B tree the insertion and deletion of the elements become more complex and also it occupies a large space when compared with the B + tree

Is This Answer Correct ?

6 Yes

1 No

Please Help Members By Posting Answers For Below Questions

Define hashing?

1032

What is a treemap used for?

887

How dynamic arrays are created?

899

For which header list, the last node contains the null pointer?

858

Which is better merge or quick sort?

949

Which is the parent class of abstractqueue class?

925

What is the complexity of arrays sort?

927

How to do the intersection of two sorted arrays?

1034

What is bubble sort?

905

Explain the difference between a list and array.

963

What is data type with example?

952

What is the difference between sorting and classifying?

937

Is hashmap part of collection?

945

What do you mean by overflow and underflow?

942

What happens when arraylist is full?

992