From 3a7a57c67b66dd51415bb25234f9208c89f53331 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Jurica=20Zuanovi=C4=87?= <jurica.zuanovic@gmail.com>
Date: Thu, 7 Mar 2019 22:23:16 +0100
Subject: [PATCH] Fix spelling (#27828)

Fixed "to to" to "to", "letfmost" to "leftmost", "definiton" to "definition"
---
 guide/english/algorithms/binary-search-trees/index.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/guide/english/algorithms/binary-search-trees/index.md b/guide/english/algorithms/binary-search-trees/index.md
index 05520d8648..de6aa5cbd0 100644
--- a/guide/english/algorithms/binary-search-trees/index.md
+++ b/guide/english/algorithms/binary-search-trees/index.md
@@ -32,7 +32,7 @@ The BST is built on the idea of the <a href='https://guide.freecodecamp.org/algo
 Initially an empty tree without any nodes is created. The variable/identifier which must point to the root node is initialized with a `NULL` value.
 
 #### Search
-You always start searching the tree at the root node and go down from there. You compare the data in each node with the one you are looking for. If the compared node doesn't match then you either proceed to the right child or the left child, which depends on the outcome of the following comparison: If the node that you are searching for is lower than the one you were comparing it with, you proceed to to the left child, otherwise (if it's larger) you go to the right child. Why? Because the BST is structured (as per its definition), that the right child is always larger than the parent and the left child is always lesser.
+You always start searching the tree at the root node and go down from there. You compare the data in each node with the one you are looking for. If the compared node doesn't match then you either proceed to the right child or the left child, which depends on the outcome of the following comparison: If the node that you are searching for is lower than the one you were comparing it with, you proceed to the left child, otherwise (if it's larger) you go to the right child. Why? Because the BST is structured (as per its definition), that the right child is always larger than the parent and the left child is always lesser.
 
 ###### Breadth-first search (BFS)
 Breadth first search is an algorithm used to traverse a BST. It begins at the root node and travels in a lateral manner (side to side), searching for the desired node. This type of search can be described as O(n) given that each node is visited once and the size of the tree directly correlates to the length of the search.
@@ -76,7 +76,7 @@ Where `n` is the number of nodes in the BST.
 
 ### Implementation of BST
 
-Here's a definiton for a BST node having some data, referencing to its left and right child nodes.
+Here's a definition for a BST node having some data, referencing to its left and right child nodes.
 
 ```c
 struct node {