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
What is hashing in cyber security?
Can map contain duplicate keys?
Are linked lists considered linear or non-linear data structures?
How do you assign an address to an element of a pointer array ?
What's the difference between an array and vector?
What is doubly linked list in data structure?
What is stack and queue in data structure?
Differentiate between iterator and listiterator.
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
Describe stack operation.
Can hashmap be sorted?
What method removes the value from the top of a stack?
What do you mean by the term “percolate up”?
What are the properties of binary heap?
Which file contains the definition of member functions?
