An AVL tree is a binary tree in which the difference between the height of

what is AVL tree?

Question Posted / kalpana rana

Answer Posted / kalpana rana

An AVL tree is a binary tree in which the difference between
the height of the right and left subtrees (or the root node)
is never more than one.

Is This Answer Correct ?

11 Yes

3 No

Please Help Members By Posting Answers For Below Questions

Is hashset synchronized?

1078

In depth questions regarding the data structures and the Databases used in the Projects developed.

1011

Can we define the size of arraylist?

981

In rdbms, explain what is the efficient data structure used in the internal storage representation?

999

What is space complexity of a program?

944

Does treemap allow null values?

916

How to compare Two Arrays?

1086

Is hashtable better than dictionary?

1007

What data type is array?

959

What is a weighted graph?

1081

What is difference between list and linked list?

1004

What are the types of binary tree?

988

What is difference between list and set?

902

Does hashset allow duplicates?

1139

What do you know about traversal in linked lists?

982