From c69217d5f8987c7828fba07bff2bdd54be352d8b Mon Sep 17 00:00:00 2001
From: rish9898 <39212648+rish9898@users.noreply.github.com>
Date: Sun, 19 May 2019 21:52:45 +0530
Subject: [PATCH] Application of AVL Trees (#25457)

---
 guide/english/algorithms/avl-trees/index.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/guide/english/algorithms/avl-trees/index.md b/guide/english/algorithms/avl-trees/index.md
index 7cd2209092..7b01e2a61a 100644
--- a/guide/english/algorithms/avl-trees/index.md
+++ b/guide/english/algorithms/avl-trees/index.md
@@ -61,3 +61,7 @@ In RR Rotation every node moves one position to right from the current position.
 The LR Rotation is combination of single left rotation followed by single right rotation. In LR Rotation, first every node moves one position to left then one position to right from the current position.
 ->Right Left Rotation (RL Rotation)
 The RL Rotation is combination of single right rotation followed by single left rotation. In RL Rotation, first every node moves one position to right then one position to left from the current position.
+
+Application of AVL Trees
+
+AVL trees are beneficial in the cases where you are designing some database where insertions and deletions are not that frequent but you have to frequently look-up for the items present in there.