Answer Posted / 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 |
Post New Answer View All Answers
What sort of serious problems have you experienced, and how have you handled them?
Can you declare an array without assigning the size of an array?
Write a program for Sorting an Array. Which sorting will you prefer?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
