Answer Posted / Chandrabhan Kushwaha
In an AVL tree, the balance factor of a node is calculated as the difference between the heights of its left and right subtrees. A node with balance factor equal to -1 or 1 is considered balanced; if it's -2 or 2, rotation adjustments are needed for balance.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
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?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
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.
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)
