what is the different between B-tree and B+ tree.
Answer Posted / adithiya guru patham.v
In a B tree the insertion and deletion of the elements become more complex and also it occupies a large space when compared with the B + tree
Is This Answer Correct ? | 6 Yes | 1 No |
Post New Answer View All Answers
What is stable sorting method?
What is the difference between a push and a pop?
What is adt in data structure?
What is bubble sort used for?
How do you rotate an AVL tree?
What is the difference between list, set and map?
What are threaded binary trees?
What is the time complexity of arrays sort?
How do you find the depth of a binary tree?
What is two-dimensional array?
What is data structure and its classification?
Differentiate between hashset and hashmap.
Is hashmap sorted?
Who invented merge sort?
Which collection allows null values?