Interested to Buy Any Domain ? << Click Here >> for more details...
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 list same as array?
What is data structure and why we need it?
How do you sort an array in descending order?
What are the different types of linked list?
What type of data structure is used to perform recursion?
Explain about the different lists available in the collection?
Can arraylist shrink?
Write a program for Sorting an Array. Which sorting will you prefer?
How do stacks work?
What is the difference between a stack and an array?
How do you represent a linked list?
Which file contains the definition of member functions?
How many passes does bubble sort need?
What do you mean by collision in hashing?
State the properties of b tree.
