Ask
Login
0
2.6kviews
Short note on AVL Tree
written 5.6 years ago by gravatar for kaivanshah kaivanshah • 260 modified 2.5 years ago by gravatar for pradnyanabar2613 pradnyanabar2613 ★ 5.1k
data structures and algorithms
ADD COMMENT EDIT
2 Answers
1
57views
written 5.6 years ago by gravatar for kaivanshah kaivanshah • 260 modified 5.6 years ago by gravatar for sanketshingote sanketshingote • 100

  1. 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.

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

ADD COMMENT EDIT
1
18views
written 2.5 years ago by gravatar for pradnyanabar2613 pradnyanabar2613 ★ 5.1k •   modified 2.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 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.