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
Is arraylist a collection?
How memory is reserved using a declaration statement in data structure?
What is structure of data type?
What is the easiest sorting method to use in data structures?
How is the front of the queue calculated ?
What is meant by binary tree traversal?
Write the recursive c function to count the number of nodes present in a binary tree.
How would you sort words in a large file?
What is arrays copyof?
What is storage structure in data structure?
Is arraylist a list?
Explain the types of linked lists.
What are the disadvantages of linear list?
Which is faster hashmap or concurrenthashmap?
What are different types of sorting algorithms?