AVL tree and four categories of rotations.

4.5kviews

written 6.5 years ago by

teamques10 ★ 70k

modified 3.8 years ago by

pradnyanabar2613 ★ 5.2k

data structures and algorithms

ADD COMMENT EDIT

1 Answer

26views

written 3.8 years ago by

pradnyanabar2613 ★ 5.2k

AVL tree:

AVL tree is a self balancing binary search tree, in which the heights of the two sub trees of a node may differ by at most one.
Due to this property, the AVL tree is also known as height balance tree.
The key advantage of using an AVL …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.