Home / MCQ Bank / Computer
Computer Advanced Trees (Avl, Redblack, Btrees) Difficulty: Medium

Which operation is not required to maintain balance in a B-Tree after insertion or deletion?

Select the correct option to test your answer:

More Computer Questions

Which one of the following sorting algorithm requires recursion? The pickle module defines . . . . . . . . exceptions and exports . . . . . . . . classes. Complete the following code for Kadane's algorithm: #include<stdio.h> int max_num(int a, int b) { if(a > b) return a; return b; } int kadane_algo(int *arr, int len) { int ans, sum, idx; ans =0; sum =0; for(idx =0; idx < len; idx++) { sum = max_num(0,sum + arr[idx]); ans = ___________; } return ans; } int main() { int arr[] = {-2, -3, 4, -1, -2, 1, 5, -3},len=7; int ans = kadane_algo(arr,len); printf("%d",ans); return 0; } What is the purpose of inheritance in Ruby classes? Which keyword is used to explicitly specify that a method cannot be overridden in a subclass?