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
Which one is the simplest sorting in data structure?
Is vector synchronized?
What happens in insertion sort?
Write the advantage of separate chaining?
What is collections singletonmap?
What is binary search tree and explain its time complexity?
Differentiate between arraylist and linkedlist.
Define 2-3 tree?
Which sorting algorithm is used in collections sort?
Is it legal to initialize list like this?
Why is arraylist used?
How arraylist increase its size?
What are the advantages of bubble sort?
Explain the term run-time stack?
What is the difference between one and two dimensional?
