diff --git a/labs/10_trees_I/README.md b/labs/10_trees_I/README.md
index 2b18f3a..6fae03e 100644
--- a/labs/10_trees_I/README.md
+++ b/labs/10_trees_I/README.md
@@ -10,6 +10,10 @@ problem 2: Create a exactly balanced binary search tree with 7 color words (orde
 
 problem 3: Draw a exactly-balanced binary search tree containing the letters of the word: uncopyrightable
 
+ 
+ 
+ 
+ 
  
  
  
@@ -19,13 +23,13 @@ What is the pre-order traversal of the tree above?
 problem 4: Now draw a exactly-balanced binary tree of characters such that a post-order traversal spells the word: uncopyrightable
 
 
-
-
-
-
-
-
-
+ 
+ 
+ 
+ 
+ 
+ 
+ 
 
 What is the breadth-first traversal of the tree above?