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 a Deque?

996

How do you sort elements in an arraylist?

832

Differentiate between queue and deque.

898

What is the difference between hashset and hashtable?

863

How do you define a set?

834

What is a spanning tree in data structure?

913

Explain the term run-time stack?

937

What is data structure geeksforgeeks?

1194

What is bubble sort technique?

826

What is the difference between set and unordered_set?

812

Does treeset remove duplicates?

872

Explain what are the methods available in storing sequential files ?

862

Which is faster array or arraylist?

833

What are the advantages of sorting?

872

What are the categories of avl rotations?

930