Interested to Buy Any Domain ? << Click Here >> for more details...
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
Treemap orders the elements on which field?
Why is data structure needed?
What is ordered map?
Is bubble sort slow?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
Which type of sorting is best?
What is a multiset table?
Define degree of the node?
Why do we use trees in data structures?
Define back edge?
Why is hashmap faster than treemap?
What is data structure and why we need it?
What is insertion sort technique?
What is the use of prototype?
Is quicksort divide and conquer?
