From befb1d4a74380348118ed36c090f9eb1bbac1996 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Sun, 3 Oct 2010 21:09:26 -0400 Subject: [PATCH] assignment4 tweaks Signed-off-by: Jim Pryor --- assignment4.mdwn | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/assignment4.mdwn b/assignment4.mdwn index cd927873..3e3b7184 100644 --- a/assignment4.mdwn +++ b/assignment4.mdwn @@ -38,7 +38,9 @@ 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. +that tells you what value is associated with a given leaf. And an operation +`extract_left` that tells you what the left subtree is of a tree that isn't a +leaf. (Presumably, `extract_right` will work similarly.)
  • 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