From 6adfe1eb3c123e9c415a9356f58c55beb9a2ec28 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Tue, 30 Nov 2010 11:19:47 -0500 Subject: [PATCH] week11 tweaks Signed-off-by: Jim Pryor --- week11.mdwn | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/week11.mdwn b/week11.mdwn index cc7af5e2..f07157f1 100644 --- a/week11.mdwn +++ b/week11.mdwn @@ -235,7 +235,7 @@ Moving upwards yet again would get us: siblings = [*; subtree 920; subtree 950] }, * filled by subtree 500' -where `subtree 500'` refers to a tree built from a root node whose children are given by the list `[*; subtree 50; subtree 80]`, with `subtree 20` inserted into the `*` position. Moving upwards yet again would get us: +where `subtree 500'` refers to a tree built from a root node whose children are given by the list `[*; subtree 50; subtree 80]`, with `subtree 20'` inserted into the `*` position. Moving upwards yet again would get us: { parent = None; @@ -252,7 +252,7 @@ We haven't given you a real implementation of the tree zipper, but only a sugges ##Same-fringe using a tree zipper## -Recall back in [[Assignment4]], we asked you to enumerate the "fringe" of a leaf-labeled tree. Both of these trees: +Recall back in [[Assignment4]], we asked you to enumerate the "fringe" of a leaf-labeled tree. Both of these trees (here I *am* drawing the labels in the diagram): . . / \ / \ -- 2.11.0