Ask
Login
1
177kviews
Construct AVL tree for the following data 21,26,30,9,4,14,28,18,15,10,2,3,7
written 2.1 years ago by gravatar for pedsangini276 pedsangini276 • 4.8k modified 2.1 years ago by gravatar for binitamayekar binitamayekar ★ 6.4k
data structures and algorithms
ADD COMMENT EDIT
1 Answer
8
42kviews
written 2.1 years ago by gravatar for binitamayekar binitamayekar ★ 6.4k modified 10 months ago by gravatar for shaquibz533 shaquibz533 • 30

AVL Tree

  • AVL Trees are Self-Balanced Binary Search Trees.

  • In AVL trees, the balancing factor of each node is either 0 or 1 or -1.

  • Balance Factor of AVL Tree calculated as = Height of Left Sub-tree - Height of Right Sub-tree

Construction of AVL Trees -

  • Insertion Operation is …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.