Answer Posted / 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 |
Post New Answer View All Answers
Write a program for Sorting an Array. Which sorting will you prefer?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
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?
Can you declare an array without assigning the size of an array?
What sort of serious problems have you experienced, and how have you handled them?
