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 benefits of using arrays?
What is structure of data type?
What is variable size arrays?and why we use it?
How do you sort a collection in descending order?
What is pivot in quicksort?
What is the prerequisite for binary searching?
What are the 3 types of variables?
Give the example of validating the parenthesis of expression using stack.
What is harvesting in agriculture?
What is data and data types?
Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.
Which is better bubble sort or selection sort?
Is an arraylist a vector?
What are the advantages and disadvantages of copyonwritearraylist?
What is binary tree and its properties?
