From 59b7d5b86690c5f51c715604aa9cb4c576d7f98d Mon Sep 17 00:00:00 2001 From: Ankit Mathur Date: Thu, 22 Nov 2018 09:27:18 +0530 Subject: [PATCH] Append more information in introduction of AVL trees. (#22425) * Update index.md Add more information in the introduction of AVL trees. * removed extraneous word --- guide/english/algorithms/avl-trees/index.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/guide/english/algorithms/avl-trees/index.md b/guide/english/algorithms/avl-trees/index.md index 897bf1a920..7cd2209092 100644 --- a/guide/english/algorithms/avl-trees/index.md +++ b/guide/english/algorithms/avl-trees/index.md @@ -4,7 +4,7 @@ title: AVL Trees ## AVL Trees -An AVL tree is a subtype of binary search tree. +An AVL tree is a subtype of binary search tree. Named after it's inventors Adelson, Velskii and Landis, AVL trees have the property of dynamic self-balancing in addition to all the properties exhibited by binary search trees. A BST is a data structure composed of nodes. It has the following guarantees: