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
Can you dynamically allocate arrays in expanded memory?
How do I sort a hashmap key?
Which interfaces are implemented by hashmap?
Does treeset allow duplicates?
Which sorting algorithm is best for small data?
Who invented quicksort?
How helpful is abstract data type of data structures?
What is a height of a tree?
How does shell sort work?
What is meant by deque?
Which is the simplest file structure?
What is a weighted graph?
What is meant by linked list?
Describe the height term in a tree.
How do you sort pseudocode?
