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

What is arrays copyof?

875

What is the purpose of thread?

967

What's the difference between a hashtable and a hashmap?

917

What is binary tree example?

956

What are the applications of graph data structure?

918

How do you find the time complexity of a bubble sort?

861

How many null values are allowed in a set?

906

What is push and pop in stack?

851

Can we add heterogeneous elements into treemap?

972

What are the collision resolution methods?

988

Can binary tree have 1 child?

905

What does the dummy header in linked list contain?

1109

Explain the implementation of an AVL tree and Binary tree.

956

Can you use Bubble Sort To sort the number of elements.

871

Define the queue data structure.

1058