Why are b trees used?
- 1 Answers
- 949 Views
- I also Faced
- E-Mail Answers
Answer / Komal
B-trees are used in databases and file systems due to their efficiency in managing large amounts of data. They allow for quick insertion, deletion, and searching while requiring minimal disk space because they can store multiple keys per node.
| Is This Answer Correct ? | 0 Yes | 0 No |
State the demerit of linear representation of binary trees?
How does a treemap sort?
What are the disadvantages of representing a stack or queue by a linked list?
How do you declare An array of three pointers to chars
Define data type and what are the types of data type?
What is heap tree?
What is the space complexity of bubble sort?
What is the use of sorting?
What is time and space complexity of bubble sort?
What is binary search in data structure?
What are the types of algorithms?
What is queue in data structure?
Windows 
