Homework now due
Questions 1–11
have been assigned due dates.
Pending homework questions
20171103

Write a tailrecursive Scheme
function
(exists predicate alist) that
returns #true if and only if there is an element of
alist that satisfies
predicate .
For instance, (exists zero? '(1 2 3))
is #false .

Write a Haskell tailrecursive
function that counts the number of leaves in a
data Tree a =
Leaf a  Branch (Tree a)
(Tree a)
tree by using continuations.
Repeat using another strategy to make the function
tailrecursive.

Write a Haskell tailrecursive
function that makes an inorder list of the leaf values in a
data Tree a =
Leaf a  Branch (Tree a)
(Tree a)
tree by using continuations.
Repeat using another strategy to make the function
tailrecursive.
