From 3e404cd075854aa1274a9cd801921b87897bade4 Mon Sep 17 00:00:00 2001
From: 25Harry <38323906+25Harry@users.noreply.github.com>
Date: Mon, 13 May 2019 03:28:05 +0530
Subject: [PATCH] Created required brackets in logn (#33401)

---
 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 4ea7d3df71..38c4261630 100644
--- a/guide/english/algorithms/b-trees/index.md
+++ b/guide/english/algorithms/b-trees/index.md
@@ -15,7 +15,7 @@ Properties of B-Tree:
 5) Number of children of a node is equal to the number of keys in it plus 1.
 6) All keys of a node are sorted in increasing order. The child between two keys k1 and k2 contains all keys in range from k1 and k2.
 7) B-Tree grows and shrinks from root which is unlike Binary Search Tree. Binary Search Trees grow downward and also shrink from downward.
-8) Like other balanced Binary Search Trees, time complexity to search, insert and delete is O(Logn).
+8) Like other balanced Binary Search Trees, time complexity to search, insert and delete is O(Log(n)).
 
 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.