From cb31839ef2a0cea9b6138fa84d487ab7107328c2 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Sun, 3 Oct 2010 03:59:22 -0400 Subject: [PATCH] tweak advanced Signed-off-by: Jim Pryor --- miscellaneous_lambda_challenges_and_advanced_topics.mdwn | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/miscellaneous_lambda_challenges_and_advanced_topics.mdwn b/miscellaneous_lambda_challenges_and_advanced_topics.mdwn index a4ba9854..a3d65e20 100644 --- a/miscellaneous_lambda_challenges_and_advanced_topics.mdwn +++ b/miscellaneous_lambda_challenges_and_advanced_topics.mdwn @@ -496,8 +496,8 @@ can use. Think about how you'd implement them in a more principled way. You could use any of the version 1 -- version 5 implementation of lists as a model. - To keep things simple, I recommend starting with the version 3 pattern. And - stick to binary trees. + To keep things simple, we'll stick to binary trees. A node will either be a + *leaf* of the tree, or it will have exactly two children. There are two kinds of trees to think about. In one sort of tree, it's only the tree's *leaves* that are labeled: -- 2.11.0