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
State the merits of linear representation of binary trees?
what are the applications of Linked Lists?
Define Data Structures?
What are the advantage of collection classes over arrays?
do records fall under linear or non linear data structures?
What is nonlinear data?
List the basic operations carried out in a linked list?
Difference between arrays and linked list?
Which is faster quick sort or merge sort?
What is concurrentlinkeddeque?
Which data structure is used in arraylist?
You want to insert a new item in a binary search tree. How would you do it?
Can arraylist have duplicates?
What do you mean by level of the tree?
What is int data type?
