Answer Posted / wonder
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 ? | 77 Yes | 9 No |
Post New Answer View All Answers
What are the disadvantages array implementations of linked list?
What is data and data structure?
Can treeset contain duplicates?
What is array and its types?
What is array traversing?
Why do we need to use computers to help us sort lists?
What is binary tree used for?
Can we increase the size of statically allocated array?
Which is better hashset or treeset?
Why use a tuple instead of a list?
What is the difference between classifying and sorting?
Why hashmap is faster than hashset?
Why is hashmap faster?
Which is faster array or linked list?
What do you mean by garbage collection?
