minor fixes

Author: amejiarosario

book-pro/content/part03/graph.asc

@@ -3,7 +3,7 @@
 // :codedir: ../../src
 // endif::[]
 
-=== Implementing a Graph
+=== Graph
 (((Graph)))
 (((Data Structures, Non-Linear, Graph)))
 Graphs are one of my favorite data structures.

book-pro/content/part03/map.asc

@@ -25,12 +25,13 @@ The attractive part of Maps is that they are very performant usually *O(1)* or *
 * *HashMap*: it’s a map implementation using an *array* and a *hash function*. The job of the hash function is to convert the `key` into an index that maps to the `value`. Optimized HashMap can have an average runtime of *O(1)*.
 * *TreeMap*: it’s a map implementation that uses a self-balanced Binary Search Tree (like <<AVL Tree>>). The BST nodes store the key, and the value and nodes are sorted by key guaranteeing an *O(log n)* look up.
 
-
+<<<
 include::hashmap.asc[]
 
+<<<
 include::treemap.asc[]
 
-
+<<<
 ==== HashMap vs TreeMap
 
 .A map can be implemented using hash functions or binary search tree:

book-pro/content/part03/tree-search-traversal.asc

@@ -1,8 +1,3 @@
-// ifndef::imagesdir[]
-// :imagesdir: ../images
-// :codedir: ../../src
-// endif::[]
-
 === Tree Search & Traversal
 
 So far we covered, how to insert/delete/search values in a binary search tree (BST).

book-pro/dsajs.asc

@@ -37,7 +37,7 @@ include::content/dedication.asc[]
 
 include::content/preface.asc[]
 
-include::content/introduction.asc[]
+// include::content/introduction.asc[]
 
 include::part01-algorithms-analysis.asc[]
 

book-pro/part02-linear-data-structures.asc

@@ -23,13 +23,15 @@ If you want to have a general overview of each one, take a look at the following
 +++
 endif::[]
 
-
 include::content/part02/array.asc[]
 
+<<<
 include::content/part02/linked-list.asc[]
 
+<<<
 include::content/part02/stack.asc[]
 
+<<<
 include::content/part02/queue.asc[]
 
 

book-pro/part03-graph-data-structures.asc

@@ -16,8 +16,10 @@ include::content/part03/tree-intro.asc[]
 <<<
 include::content/part03/binary-search-tree.asc[]
 
+<<<
 include::content/part03/tree-search-traversal.asc[]
 
+<<<
 include::content/part03/binary-search-tree-traversal.asc[]
 
 <<<