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

Can we modify final arraylist?

1018

How will you free the memory that is allocated at run time?

957

What is the best sorting technique?

921

What is the complexity of arrays sort?

901

What are the applications of stack?

886

Different Types of pattern?

952

Tell me about the different sorting techniques.

892

Which interfaces are implemented by concurrentskiplistset?

848

What does enum do?

895

What do you mean by rehashing?

1144

Can the double-checked locking fail on a single processor system?

1002

What is type structure?

852

What is dynamic array how is it created?

861

Write an algorithm to show the reverse of link list?

846

List the applications of set adt?

898