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 difference between hashset and linkedhashset?
How do you sort a map by key?
How to reference all the elements in a one-dimension array?
What is the difference between hashmap and treemap?
What is complete binary tree and almost complete binary tree?
Explain the common uses of threaded binary tree.
Define union-by-weight?
What is a postfix expression?
How do you increase the capacity of an arraylist?
What is the difference between a stack and an array?
Give a real time example of stack
How long does it take to master data structures and algorithms?
What is the difference between push and pop?
Which sorting algorithm is used in arrays sort?
What is the difference between Strings and Arrays?
