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 is long data type?
What is merge sort and how it works?
Which is better hashmap or treemap?
What is a data structure definition?
What is meant by binary tree traversal?
Is copyonwritearraylist thread safe?
Which is the parent class of deque
Does concat mutate array?
What is the Role of push() and pop() method?
What does bubble sort do?
What is a spanning tree?does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Explain what are the major data structures used in the network data model?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
How do you find the complexity of a selection sort?
What is harvesting in agriculture?
