Answer Posted / nani
A B+ tree is a data structure in which records associated
with the search keys are at the leaves of the tree.This
provide efficient retrieval,insertion and removal of
records.Keys are triplicale to the non-leaf nodes to
provide a path to the searched record.
NT file system,JFS2 file system and Rationaldata base often
used this data structure for indices.
| Is This Answer Correct ? | 11 Yes | 11 No |
Post New Answer View All Answers
What is b tree in data structure?
What is inplace sorting?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
What is an array vs list?
What's the difference between a hashtable and a hashmap?
What is a undirected graph?
Is an arraylist a vector?
What is the best complexity of bubble sort?
Is vector a collection?
How do you sort an array in decreasing order?
How do you represent a linked list?
How does shell sort work?
Does linkedhashset allow null values?
Is array of data structure?
What is sorting explain?
