Home / MCQ Bank / Computer
Computer Binary Search Trees(B Tree) Difficulty: Medium

A binary tree is balanced if the difference between left and right subtree of every node is not more than . . . . . . . .

Select the correct option to test your answer:

More Computer Questions

The data members of a class by default are? What is the output of the given code? a=5 b=15 while a&&b puts a+b end What does the commit() method do in the context of database transactions? The time complexity of the following recursive implementation to find the factorial of a number is . . . . . . . . int fact(int n) { if(_________) return 1; return n * fact(n - 1); } int main() { int n = 5; int ans = fact(n); printf("%d",ans); return 0; } Which of the following is not a channel of mozilla?