Define b-tree of order m?
- 1 Answers
- 1052 Views
- I also Faced
- E-Mail Answers
Answer / Komal Devi
A B-tree of order m is a self-balancing tree data structure, used where you need to insert, delete, or search for keys efficiently in large sets. It supports keys and a pointer to a child node for each node. The key count in the nodes ranges from (m/2)-1 to 2*(m/2)-1.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the height of an empty tree?
Is it legal to initialize list like this?
create an singly linked lists and reverse the lists by interchanging the links and not the data?
What do you mean by hash function?
Mention the data structures which are used in graph implementation.
For which header list, the last node contains the null pointer?
Are sets sorted?
Explain about map and their types?
In what areas do data structures applied?
Do sets allow duplicates?
Which collection class is thread safe?
Why is waste sorting important?
Windows 
