Construct an AVL Tree with following data: 10 15 9 12 13 79 45 36 22

Welcome back.

and 4 others joined a min ago.

9.3kviews

written 2.1 years ago by

modified 2.1 years ago by

binitamayekar ★ 6.4k

Construct an AVL Tree with following data: 10 15 9 12 13 79 45 36 22

ADD COMMENT EDIT

1 Answer

2.3kviews

written 2.1 years ago by

binitamayekar ★ 6.4k

• modified 2.1 years ago

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 2 others joined a min ago.

ADD COMMENT EDIT

Community

Content

Company