Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / amit patra
In a B+ tree all keys which are in non leaf node will point to
next leaf, So we can traverse sequentially also.
| Is This Answer Correct ? | 11 Yes | 3 No |
Post New Answer View All Answers
Why is quicksort better than mergesort?
Is hashset thread safe?
What is the impact of signed numbers on the memory?
What is bubble sort?
Is array size dynamic or fixed?
Explain what are the notations used in evaluation of arithmetic expressions using prefix and postfix forms?
Define a complete binary tree?
How do I start preparing for placement?
Can arraylist contain duplicates?
Is arraylist faster than array?
How does a selection sort work for an array?
Name some applications which use linked lists.
Is any implicit arguments are passed to a function when it is called?
Why we use arraylist instead of linked list?
What is the difference between hashset and linkedhashset?
