From f3e44d1a6911bf2bf8376bd3b711adf63cdeee13 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Sun, 3 Oct 2010 21:07:13 -0400 Subject: [PATCH 1/1] assignment4 tweaks Signed-off-by: Jim Pryor --- assignment4.mdwn | 11 ++++++++--- 1 file changed, 8 insertions(+), 3 deletions(-) diff --git a/assignment4.mdwn b/assignment4.mdwn index 8b8a19dc..cd927873 100644 --- a/assignment4.mdwn +++ b/assignment4.mdwn @@ -34,9 +34,14 @@ First, read this: [[Implementing trees]]
  1. Write an implementation of leaf-labeled trees. You can do something v3-like, or use the Y combinator, as you prefer. - You'll need an operation `make_leaf` that turns a label into a new leaf. You'll need an operation `make_node` that takes two subtrees (perhaps leaves, perhaps other nodes) and joins them into a new tree. You'll need an operation `isleaf` that tells you whether a given tree is a leaf. And an operation `extract_label` that tells you what value is associated with a given leaf. - -
  2. The **fringe** of a leaf-labeled tree is the list of values at its leaves, ordered from left to right. For example, the fringe of this tree: +You'll need an operation `make_leaf` that turns a label into a new leaf. You'll +need an operation `make_node` that takes two subtrees (perhaps leaves, perhaps +other nodes) and joins them into a new tree. You'll need an operation `isleaf` +that tells you whether a given tree is a leaf. And an operation `extract_label` +that tells you what value is associated with a given leaf. + +
  3. The **fringe** of a leaf-labeled tree is the list of values at its leaves, +ordered from left to right. For example, the fringe of this tree: . / \ -- 2.11.0