Update intro-bst.md

Author: Utkarsh1504

lessons/intro-bst.md

@@ -40,7 +40,7 @@ Then the contents of this in-order successor are copied to the node to be delete
 Finally, the in-order successor is deleted
 <br>
 
-## Let's see the implementation of Binary Search Tree using an example:
+Let's see the implementation of Binary Search Tree using an example:
 
 ```java
 // Java implementation of recursive Binary Search
@@ -93,4 +93,4 @@ Element is present at index 3
 ```
 
 ## Visualisations 
-[BinarySearch Visualisation](https://www.cs.usfca.edu/~galles/visualization/BST.html)
+[BinarySearch Visualisation](https://www.cs.usfca.edu/~galles/visualization/BST.html)