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
What are the applications of priority queues?
Provide an algorithm to reverse a linked list without using recursion.
Why do we use linked lists?
Explain the common uses of threaded binary tree.
Can a stack be described as a pointer? Explain.
What do you mean by level of the tree?
Explain binary representation?
Can arraylist hold duplicates?
How do you determine if a binary tree is height balanced?
Which is better hashmap or hashtable?
What is a data structure? What are the types of data structures? Briefly explain them
Tell me how to find middle element of linked list in one pass?
Explain recursive function & what is the data structures used to perform recursion?
Is quicksort faster than merge sort?
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential
