edits

[lambda.git] / assignment3.mdwn

diff --git a/assignment3.mdwn b/assignment3.mdwn
index 9f64d80..1ce112e 100644 (file)
--- a/assignment3.mdwn
+++ b/assignment3.mdwn
@@ -106,14 +106,16 @@ be your base case for your recursive functions that operate on trees.
 Write a function that sums the number of leaves in a tree.
 Expected behavior:
 
-let t1 = (make-list 1 nil) 
-let t2 = (make-list 2 nil)
-let t3 = (make-list 3 nil)
-let t12 = (make-list t1 (make-list t2 nil))
-let t23 = (make-list t2 (make-list t3 nil))
-let ta = (make-list t1 t23)
-let tb = (make-list t12 t3)
-let tc = (make-list t1 (make-list t23 nil))
+<pre>
+
+let t1 = (make-list 1 nil) in
+let t2 = (make-list 2 nil) in
+let t3 = (make-list 3 nil) in
+let t12 = (make-list t1 (make-list t2 nil)) in
+let t23 = (make-list t2 (make-list t3 nil)) in
+let ta = (make-list t1 t23) in
+let tb = (make-list t12 t3) in
+let tc = (make-list t1 (make-list t23 nil)) in
 
 count-leaves t1 ~~> 1
 count-leaves t2 ~~> 2
@@ -123,6 +125,7 @@ count-leaves t23 ~~> 5
 count-leaves ta ~~> 6
 count-leaves tb ~~> 6
 count-leaves tc ~~> 6
+<pre>
 
 Write a function that counts the number of leaves.
 
@@ -147,3 +150,12 @@ reverse (makeList 1 (makeList 2 (makeList 3 nil)))
 It may require more resources than my browser is willing to devote to
 JavaScript.]
 
+; trees
+let t1 = (makeList 1 nil) in
+let t2 = (makeList 2 nil) in
+let t3 = (makeList 3 nil) in
+let t12 = (makeList t1 (makeList t2 nil)) in
+let t23 = (makeList t2 (makeList t3 nil)) in
+let ta = (makeList t1 t23) in
+let tb = (makeList t12 t3) in
+let tc = (makeList t1 (makeList t23 nil)) in