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 two traversal strategies used in traversing a graph?
What is stack in data structure with the example?
Define balanced trees?
What are different types of sorting algorithms?
What is a data structure node class?
Describe tree database.
What is example of data?
What is a vector class?
What are the advantages of merge sort?
Write the c program to insert a node in circular singly list at the beginning.
Is pointer a variable?
What is a sorting algorithm in data structure?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
List the differences between comparable and comparator interface?
What is priority queue in data structure?
