In an AVL tree, at what condition the balancing is to be done?

Question Posted / ajay vikram

In an AVL tree, at what condition the balancing is to be done?..

Answer / ajay vikram

If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than –1.

Is This Answer Correct ?

0 Yes

0 No

More Data Structures Interview Questions

What do you mean by heap order property?

How would you dynamically allocate a one-dimensional and two-dimensional array of integers?

If you are using c language to implement the heterogeneous linked list, what pointer type should be used?

Is json a data structure?

what is the difference between Linear Array and Linked List?

What are the applications of stack?

List the data structures which are used in hierarchical data model.

What are different types of algorithms?

Write the syntax in c to create a node in the singly linked list.

Is hashmap sorted?

What is list and types of list?

How to use appendNode() in linkedlist()?

For more Data Structures Interview Questions Click Here