gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Append more information in introduction of AVL trees. (#22425)

Browse Source 
* Update index.md

Add more information in the introduction of AVL trees.

* removed extraneous word
This commit is contained in:
Ankit Mathur
2018-11-22 09:27:18 +05:30
committed by Tom
parent 97a852858f
commit 59b7d5b866
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
guide/english/algorithms/avl-trees/index.md
View File

@ -4,7 +4,7 @@ title: AVL Trees
## 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: A BST is a data structure composed of nodes. It has the following guarantees: