State the properties of b tree.
- 1 Answers
- 1170 Views
- I also Faced
- E-Mail Answers
Answer / Pradeep Kumar Bhati
A B-Tree is a self-balancing multiway search tree data structure used for managing large sorted datasets that can be arbitrarily multi-dimensional, such as databases or file systems. Here are its key properties:
1. Each node has a fixed number n of keys and n+1 pointers.
2. The keys in a node are ordered from smallest to largest.
3. Each key appears at most one time in the tree.
4. Every key in a node is greater than or equal to all the keys in its subtree pointed by it except the leftmost subtree.
5. For any given node, all the keys in the left subtree are smaller and all the keys in the right subtree are greater.
6. The root node can have zero or more keys. If the root has fewer than n keys, then all its successors have more than n+1 keys.
| Is This Answer Correct ? | 0 Yes | 0 No |
How is it possible to insert different type of elements in stack?
How do arrays work?
Do you know what is linear search?
Does arraylist contain duplicates?
Differentiate between the singly linked list and doubly linked list.
What is a multiset table?
What do you mean by sorting?
What are data structures in programming?
What is the space complexity of bubble sort?
What is ds heap sort?
How does quick sort work?
What is concurrentlinkeddeque?
Windows 
