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

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



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is difference between concurrenthashmap and hashtable?

420


What are lists?

523


What are the different types of data structures?

526


Can a stack be described as a pointer? Explain.

452


What are the properties of an algorithm?

505






What is int data type?

536


What do you mean by shortest path?

533


Which is faster quick sort or merge sort?

476


How many parts are there in a declaration statement?

538


Does concurrenthashmap allow null?

482


What is difference between while and do while?

461


Define primary data structures?

577


Is treemap sorted?

521


What happens if an array goes out-of-bounds?

662


What is the difference between file structure and storage structure?

510