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

What is bubble sort technique?

854

When is a binary search best applied?

866

What is the difference between Array and LinkedList?

990

Define parent node?

956

What is adt example?

998

Why is an array homogeneous?

836

How does quicksort partition work?

947

What is immutablelist?

894

How do you reference all the elements in a one-dimension array?

1020

What is significance of ” * ” ?

1011

What is the need of sorting?

898

How many links are there in a binary tree of N nodes?

1012

Explain the steps to insert data into a singly linked list?

852

What are the major data structures used in the network data model?

1050

What is a b+ tree? Explain its uses.

940