fixes format

Author: amejiarosario

book/content/part03/binary-search-tree.asc

@@ -52,12 +52,12 @@ With the methods `add` and `remove`, we have to guarantee that our tree always h
 ===== Inserting new elements in a BST
 
 .For inserting an element in a BST, we have two scenarios:
-1.  If the tree is empty (root element is null), we add the newly created node as root, and that's it!
-2.  If the tree has a root, compare the new value with the root. Then we have three possibilities:
-2.1. `root == newValue`: we increase the duplicity counter in that case, and done!
-2.2  `root > newValue`, we search on the left side of the root.
-2.3 `root < newValue`, we search on the right side of the root.
-3.  Repeat the comparison between the current node and `newValue`, until we find the value or (null) space.
+. If the tree is empty (root element is null), we add the newly created node as root, and that's it!
+. If the tree has a root, compare the new value with the root. Then we have three possibilities:
+.. `root == newValue`: we increase the duplicity counter in that case, and done!
+.. `root > newValue`, we search on the left side of the root.
+.. `root < newValue`, we search on the right side of the root.
+. Repeat the comparison between the current node and `newValue`, until we find the value or (null) space.
 
 For instance, let’s say that we want to insert the values 19, 21, 10, 2, 18 in a BST:
 

book/content/part03/graph.asc

@@ -297,7 +297,7 @@ include::{codedir}/data-structures/graphs/node.js[tag=removeAdjacent, indent=0]
 .2+.^s| Data Structure 2+^s| Vertices 2+^s| Edges .2+^.^s| Space Complexity
 ^|_Add_ ^|_Remove_ ^|_Add_ ^|_Remove_
 | Graph (adj. matrix) ^| O(\|V\|^2^) ^| O(\|V\|^2^) ^|O(1) ^|O(1) ^|O(\|V\|^2^)
-| Graph (adj. list w/array) ^| O(1) ^| O(\|V\| + \|E\|)) ^|O(1) ^|O(\|V\| + \|E\|) ^|O(\|V\| + \|E\|)
+| Graph (adj. list w/array) ^| O(1) ^| O(\|V\| + \|E\|)) ^|O(1) ^|O(\|E\|) ^|O(\|V\| + \|E\|)
 | Graph (adj. list w/HashSet) ^| O(1) ^| O(\|V\|)) ^|O(1) ^|O(1) ^|O(\|V\| + \|E\|)
 |===
 // end::table[]