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

Can we make hashmap synchronized?

985

What is array define its types?

1018

What sorting algorithm should be used for sorting strings?

982

What is data structures in computer science?

967

What is the difference between b tree and binary search tree?

919

Explain the uses of matrix with an example?

1056

How hashmap increases its size?

1058

What do you mean by balance factor of a node in avl tree?

972

Does arraylist maintain order?

945

How is heap sort implemented?

891

What method removes the value from the top of a stack?

1005

Explain what is the data structures used to perform recursion?

997

Tell me the difference between the character array and a string.

1015

What is array and its types with example?

965

Is arraylist faster than array?

961