From 0ee212d5afc197a15f9391a0fb1862e1763f05ae Mon Sep 17 00:00:00 2001 From: maninaik Date: Sun, 19 May 2019 21:54:45 +0530 Subject: [PATCH] changed the properties of avl trees (#27322) 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. --- guide/english/algorithms/avl-trees/index.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/guide/english/algorithms/avl-trees/index.md b/guide/english/algorithms/avl-trees/index.md index a08a32d8fd..fe1c4a8fda 100644 --- a/guide/english/algorithms/avl-trees/index.md +++ b/guide/english/algorithms/avl-trees/index.md @@ -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.