summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
Diffstat (limited to 'src')
-rw-r--r--src/03/README.md9
1 files changed, 5 insertions, 4 deletions
diff --git a/src/03/README.md b/src/03/README.md
index cb39842..7ecce3b 100644
--- a/src/03/README.md
+++ b/src/03/README.md
@@ -1,7 +1,8 @@
-# Learning Profile for Assignment #3 - Computer Science 272: Data Structures and Algorithms
+# Learning Profile for Assignment #3
+## Computer Science 272: Data Structures and Algorithms
-Name: Mo Khan
-Student ID: 3431709
+* Name: Mo Khan
+* Student ID: 3431709
## Question 1
### Problem Statement
@@ -991,7 +992,7 @@ Suppose we have a function `h` that takes input `k`
and returns a tree with `k` leaves.
For each positive natural number we can
-assert that the height of the tree must greater
+assert that the height of the tree must be greater
than or equal to `log2(k)`.
```plaintext