From 3413848b5c8bc4595d42582d8cec56e2f09b3282 Mon Sep 17 00:00:00 2001
From: Qbuiba <37890918+Qbuiba@users.noreply.github.com>
Date: Mon, 3 Dec 2018 04:09:25 +0700
Subject: [PATCH] lowercase the "The" word (#24022)

---
 guide/english/algorithms/b-trees/index.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/guide/english/algorithms/b-trees/index.md b/guide/english/algorithms/b-trees/index.md
index c05eb1c7b0..7fa7168b62 100644
--- a/guide/english/algorithms/b-trees/index.md
+++ b/guide/english/algorithms/b-trees/index.md
@@ -18,7 +18,7 @@ Properties of B-Tree:
 8) Like other balanced Binary Search Trees, time complexity to search, insert and delete is O(Logn).
 
 Search:
-Search is similar to search in Binary Search Tree. Let the key to be searched be k. We start from root and recursively traverse down. For every visited non-leaf node, if the node has key, we simply return the node. Otherwise we recur down to the appropriate child (The child which is just before the first greater key) of the node. If we reach a leaf node and don’t find k in the leaf node, we return NULL.
+Search is similar to search in Binary Search Tree. Let the key to be searched be k. We start from root and recursively traverse down. For every visited non-leaf node, if the node has key, we simply return the node. Otherwise we recur down to the appropriate child (the child which is just before the first greater key) of the node. If we reach a leaf node and don’t find k in the leaf node, we return NULL.
 
 Traverse:
 Traversal is also similar to Inorder traversal of Binary Tree. We start from the leftmost child, recursively print the leftmost child, then repeat the same process for remaining children and keys. In the end, recursively print the rightmost child.