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

changed the properties of avl trees (#27322)

Browse Source 
Changed the property that said that the AVL tree can have zero or more child nodes to avl tree can have zero, one or two child nodes.
This commit is contained in:
maninaik
2019-05-19 21:54:45 +05:30
committed by Christopher McCormack
parent 28283d7197
commit 0ee212d5af
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -9,8 +9,8 @@ An AVL tree is a subtype of binary search tree. Named after it's inventors Adels
A BST is a data structure composed of nodes. It has the following guarantees:
1. Each tree has a root node (at the top).
2. The root node has zero or more child nodes.
3. Each child node has zero or more child nodes, and so on.
2. The root node has zero, one or two child nodes.
3. Each child node has zero, one or two child nodes, and so on.
4. Each node has up to two children.
5. For each node, its left descendents are less than the current node, which is less than the right descendents.