what is the different between B-tree and B+ tree.
- 8 Answers
- 44949 Views
- Syntel, I also Faced
- E-Mail Answers
Answer Posted / deependra rathode 9993072052
In a B-tree, pointers to data records exist at all levels of
the tree
In a B+-tree, all pointers to data records exists at the
leaf-level nodes
A B+-tree can have less levels (or higher capacity of search
values) than the corresponding B-tree
| Is This Answer Correct ? | 11 Yes | 3 No |
Post New Answer View All Answers
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Write a program for Sorting an Array. Which sorting will you prefer?
What sort of serious problems have you experienced, and how have you handled them?
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.
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Can you declare an array without assigning the size of an array?
