Signed-off-by: Jim Pryor <profjim@jimpryor.net>
function, write a function that computes factorials. (Recall that n!,
the factorial of n, is n times the factorial of n-1.)
function, write a function that computes factorials. (Recall that n!,
the factorial of n, is n times the factorial of n-1.)
-Warning: it takes a long time for my browser to compute factorials larger than 4!
+ Warning: it takes a long time for my browser to compute factorials larger than 4!
3. (Easy) Write a function `equal_length` that returns true just in case
two lists have the same length. That is,
3. (Easy) Write a function `equal_length` that returns true just in case
two lists have the same length. That is,
be your base case for your recursive functions that operate on these
trees.
be your base case for your recursive functions that operate on these
trees.
-1. Write a function that sums the number of leaves in a tree.
+<OL start=6>
+<LI>Write a function that sums the number of leaves in a tree.
-2. Write a function that counts the number of leaves.
+<LI>Write a function that counts the number of leaves.
+
+</OL>