From b3de6c162481f6d2b8e885b8ec94033495a4e1eb Mon Sep 17 00:00:00 2001 From: Nishant Shah Date: Sun, 10 Apr 2022 11:18:47 +0530 Subject: [PATCH] Corrected Typo --- lessons/intro-trees.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lessons/intro-trees.md b/lessons/intro-trees.md index e665a0a2..1bb51a53 100644 --- a/lessons/intro-trees.md +++ b/lessons/intro-trees.md @@ -59,7 +59,7 @@ The pictorial representation of BST is ### AVL Tree -AVL trees are considered as the variants of binary tree which have the characteristics of both Binary tree and Binary search tree. These trees are self-balanced which means the height of left sub tree and right are sub tree are equal. This balanced is measured in terms of balancing factor. +AVL trees are considered as the variants of binary tree which have the characteristics of both Binary tree and Binary search tree. These trees are self-balanced which means the height of left sub tree and right sub tree are equal. This balanced is measured in terms of balancing factor. ![AVL](./images/AVL.png)