Define balance factor of a node in avl tree?
- 1 Answers
- 1137 Views
- I also Faced
- E-Mail Answers
Answer / 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 |
What is bubble sort algorithm in data structure sort and searching?
Explain binary searching and Fibinocci search?
Can we use any class as map key?
Is null allowed in list?
Describe the level term in a tree.
Do you know how to find if linked list has loop?
What is adt in data structure with example?
What are the applications of b-tree?
What do you mean by balanced trees?
What are the complexity of binary search?
What is indexing an array?
Define double linked list?
Windows 
