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

Define balancing condition for AVL Tree.

1115

Which is better hashmap or hashtable?

979

Does list maintain insertion order?

944

What is bubble sort algorithm in data structure sort and searching?

952

What are the basic operations of stack?

957

What are linked list?

996

State the difference between arrays and linked lists?

1051

Write program for Bubble Sort ?

1031

What is minimum depth of binary tree?

1022

What is the height of a binary tree?

1000

Why do we use sorting?

923

What are the disadvantages of using collection classes over arrays?

1118

Why is the isempty() member method called?

1099

Is hashmap fail safe?

1031

What is hashing in cyber security?

954