diff --git a/GA3/ga3.pdf b/GA3/ga3.pdf
index a4c5900..3dddf62 100644
Binary files a/GA3/ga3.pdf and b/GA3/ga3.pdf differ
diff --git a/GA3/ga3.tex b/GA3/ga3.tex
index 3ea7d56..3e78514 100644
--- a/GA3/ga3.tex
+++ b/GA3/ga3.tex
@@ -8,6 +8,7 @@
 
 \title{Graded Assignment 3 -- DSA}
 \author{Claudio Maggioni}
+\setlength{\parindent}{0cm}
 
 % listings configuration
 \lstset{
@@ -354,8 +355,10 @@ Insert 2:
                            10R     12B         15B
                                               /
                                            14R
-\end{verbatim}
-}
+\end{verbatim}%
+}%
+%
+Assume every empty branch has as a child a black leaf node.
 
 \subsection{Point B}
 
@@ -394,7 +397,7 @@ FUNCTION JOIN-INTERVALS(X)
       n $\gets$ n + 1
   X.length $\gets$ 2 * n    
 \end{lstlisting}
-\\
+%
 The complexity of this algorithm is $O(n\log(n))$ since the sorting is in $\Theta(n\log(n))$ and the
 union operation afterwards is $\Theta(n)$.