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 data structure and why we need them?
Is arraylist better than array?
Is treeset synchronized?
Explain implementation of traversal of a binary tree.
Does stringutils isempty check for null?
What is data structure definition?
What is the difference between hashmap and arraylist?
Should I use hashmap or hashtable?
Is queue fifo or lifo?
What do you mean by heap order property?
Explain about set and their types in a collection?
Is treemap synchronized?
What is meant by balanced binary tree?
Where is binary tree used?
What is difference between hashmap and treemap?
