Added links to the BST source and a brief explanation of how it works

Author: nameghino

README.markdown

@@ -25,6 +25,7 @@ If you're new to algorithms and data structures, here are a few good ones to sta
 - Binary Tree
 - Merge Sort
 - [Boyer-Moore](Boyer-Moore/) string search
+- [Binary Search Tree](Binary Search Tree/)
 
 ## The algorithms
 
@@ -86,7 +87,7 @@ Bad sorting algorithms (don't use these!):
 
 ## Data structures
 
-The choice of data structure for a particular task depends on a few things. 
+The choice of data structure for a particular task depends on a few things.
 
 First, there is the shape of your data and the kinds of operations that you'll need to perform on it. If you want to look up objects by a key you need some kind of dictionary; if your data is hierarchical in nature you want a tree structure of some sort; if your data is sequential you want a stack or queue.
 
@@ -117,7 +118,7 @@ Often just using the built-in `Array`, `Dictionary`, and `Set` types is sufficie
 
 - Tree (general-purpose)
 - Binary Tree
-- Binary Search Tree (BST)
+- [Binary Search Tree (BST)](Binary Search Tree/). A binary tree with the special requirement that elements are inserted according to a specified value, allowing for faster queries, as if using a [binary search](Binary Search/) algorithm.
 - AVL Tree
 - Red-Black Tree
 - Splay Tree
@@ -137,7 +138,7 @@ Often just using the built-in `Array`, `Dictionary`, and `Set` types is sufficie
 
 ### Hashing
 
-- [Hash Table](Hash Table/). Allows you to store and retrieve objects by a key. This is how the dictionary type is usually implemented. 
+- [Hash Table](Hash Table/). Allows you to store and retrieve objects by a key. This is how the dictionary type is usually implemented.
 - Hash Functions
 
 ### Graphs