Short note on AVL Tree

Welcome back.

and 2 others joined a min ago.

3.4kviews

written 7.6 years ago by

sumayassrbg2000 • 0

modified 4.5 years ago by

bhaskar12082000 • 0

data structures and algorithms

ADD COMMENT EDIT

2 Answers

59views

written 7.6 years ago by

sumayassrbg2000 • 0

modified 7.6 years ago by

ddigantarroy • 0

Searching in a binary search tree is efficient if the heights of both left and right sub-trees of any node are equal.However, frequent insertions and deletions in a BST are likely to make it unbalanced.
The efficiency of searching is ideal if the difference between left and right sub-trees of …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

25views

written 4.5 years ago by

bhaskar12082000 • 0

• modified 4.5 years ago

AVL Tree

An AVL tree (Adelson-Velskii and Landis; tree, named after the inventors) is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the heights of the two-child subtrees of any node differ by at most one; if at any …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Community

Content

Company