Merge pull request amejiarosario#94 from amejiarosario/feat/set-improvements

Feat/set improvements

Author: amejiarosario

README.md

@@ -271,8 +271,8 @@ Use Linked Lists when:
 #### [HashMaps](book/content/part03/map.asc)
 
 Learn how to implement different types of Maps such as:
-- [HashMap](book/content/part03/hashmap.asc)
-- [TreeMap](book/content/part03/treemap.asc)
+- [HashMap](book/content/part02/hash-map.asc)
+- [TreeMap](book/content/part03/tree-map.asc)
 
 Also, [learn the difference between the different Maps implementations](book/content/part03/time-complexity-graph-data-structures.asc):
 

book/B-self-balancing-binary-search-trees.asc

@@ -36,8 +36,8 @@ Let's go one by one.
 
 Right rotation moves a node on the right as a child of another node.
 
-Take a look at the `@example` in the code below.
-As you can see we have an unbalanced tree `4-3-2-1`.
+Take a look at the examples in the code in the next section.
+As you will see we have an unbalanced tree `4-3-2-1`.
 We want to balance the tree, for that we need to do a right rotation of node 3.
 So, we move node 3 as the right child of the previous child.
 
@@ -140,4 +140,3 @@ This rotation is also referred to as `RL rotation`.
 === Self-balancing trees implementations
 
 So far, we have study how to make tree rotations which are the basis for self-balancing trees. There are different implementations of self-balancing trees such a Red-Black Tree and AVL Tree.
-