Construct AVL tree for the following data 21,26,30,9,4,14,28,18,15,10,2,3,7

Welcome back.

and 3 others joined a min ago.

295kviews

written 3.0 years ago by

pedsangini276 • 4.8k

modified 3.0 years ago by

binitamayekar ★ 6.7k

data structures and algorithms

ADD COMMENT EDIT

1 Answer

69kviews

written 3.0 years ago by

binitamayekar ★ 6.7k

modified 21 months ago by

shaquibz533 • 30

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 -

and 3 others joined a min ago.

ADD COMMENT EDIT

Community

Content

Company