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
What is the use of hashtable?
What is the difference between the hash table and hash map?
What is unbounded queue?
What is internal and external sorting?
What does each entry in the link list called?
What is the difference between hashmap and treemap?
Which is faster hashmap or linkedhashmap?
What is ds heap sort?
Which sorting is best in time complexity?
How do I use quick sort?
Can we define the size of arraylist?
Is array immutable?
Differentiate between queue and stack.
What is difference between hashmap and treemap?
What is a circular singly linked list?
