In a B- tree you can store both keys and data in the internal/leaf nodes.

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

Question Posted / kamar rahi

Answer Posted / kamar rahi

In a B- tree you can store both keys and data in the
internal/leaf nodes. But in a B+ tree you have to store the
data in the leaf nodes only.

Is This Answer Correct ?

60 Yes

6 No

Please Help Members By Posting Answers For Below Questions

Are collections thread safe?

787

Can you override methods of arraylist?

920

What is the advantage of circular linked list?

755

Can value be null in treemap?

839

Which interfaces are implemented by enumset?

833

Are dictionaries mutable?

814

What do you mean by linear probing?

991

Are sets sorted?

846

Is boolean a data type?

886

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

828

Give a basic algorithm for searching a binary search tree?

777

How dynamic arrays are created?

839

What is the default size of arraylist?

903

How does variable declaration affect memory allocation?

1703

What is quick sort example?

814