From 7793f6eb11916d90b8efed89e0e74ad7da60d463 Mon Sep 17 00:00:00 2001
From: Jidong Xiao <xiaoj8@rpi.edu>
Date: Mon, 30 Oct 2023 20:52:49 -0400
Subject: [PATCH] testing empty lines

---
 labs/10_trees_I/README.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/labs/10_trees_I/README.md b/labs/10_trees_I/README.md
index c730629..2b18f3a 100644
--- a/labs/10_trees_I/README.md
+++ b/labs/10_trees_I/README.md
@@ -10,7 +10,9 @@ 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
 
-<div style="width: 100%; height: 200px; border: 1px solid #000;"></div>
+&nbsp;
+&nbsp;
+&nbsp;
 
 What is the pre-order traversal of the tree above?