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 a null element added to a treeset or hashset?

872

What is a pass in bubble sort?

901

If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?

956

Define ancestor and descendant ?

1052

Is hashmap a data structure?

1007

How will you reverse Linked List.

902

Why is hashing used?

862

What does enum do?

921

an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).

910

What is the difference between hashset and treeset?

999

What is the difference between null and void pointer in data structures?

1163

What are the tasks performed while traversing a binary tree?

1141

Can hashmap have same key?

879

What is difference between list set and map?

896

What is tree in computer science?

980