Interested to Buy Any Domain ? << Click Here >> for more details...
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
How can avl tree be useful in all the operations as compared to binary search tree?
What is difference between list and linked list?
Define in brief an array.
What package is arraylist?
Can a class have a constructor?
What is the difference between data type and data structure?
Is radix sort stable?
How do you do a selection sort?
Does set allow null values?
Write an algorithm that counts number of nodes in the circular linked list
What is queue example?
What are the major data structures used in the hierarchical data model?
For searches. Which one is most preferred: array list or linked list?
Why do we need sorting algorithms?
Tell me do array subscripts always start with zero?
