diff --git a/guide/english/algorithms/b-trees/index.md b/guide/english/algorithms/b-trees/index.md
index a506d2e799..4ea7d3df71 100644
--- a/guide/english/algorithms/b-trees/index.md
+++ b/guide/english/algorithms/b-trees/index.md
@@ -22,3 +22,6 @@ Search is similar to search in Binary Search Tree. Let the key to be searched be
 
 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.
+
+Insertion:
+We insert into the bottom of a B-tree, similar to binary search trees. First, find an appropriate place at the bottom of the tree to insert a given key, and perform the insertion (also adding an additional empty child). If the node is too big (it has m keys and m + 1 (empty) children), split the node.