From 156112d5318daed7c47e18e982a6f8a12b498fd7 Mon Sep 17 00:00:00 2001
From: jim
Date: Sat, 7 Mar 2015 21:11:31 -0500
Subject: [PATCH] renumber hint
---
exercises/assignment5.mdwn | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/exercises/assignment5.mdwn b/exercises/assignment5.mdwn
index 00ede5aa..f0ee4811 100644
--- a/exercises/assignment5.mdwn
+++ b/exercises/assignment5.mdwn
@@ -116,7 +116,7 @@ Choose one of these languages and write the following functions.
6. How would you use the function defined in problem 4 to enumerate a tree's fringe? (Don't worry about whether it comes out left-to-right or right-to-left.)
-7. Write a recursive function to make a copy of a `color_tree` with the same structure and inner branch colors, but where the leftmost leaf is now labeled `0`, the second-leftmost leaf is now labeled `1`, and so on. (Here's a [[hint|assignment5 hint3]], if you need one.)
+7. Write a recursive function to make a copy of a `color_tree` with the same structure and inner branch colors, but where the leftmost leaf is now labeled `0`, the second-leftmost leaf is now labeled `1`, and so on. (Here's a [[hint|assignment5 hint4]], if you need one.)
8. (More challenging.) Write a recursive function that makes a copy of a `color_tree` with the same structure and inner branch colors, but replaces each leaf label with the `int` that reports how many of that leaf's ancestors are labeled `Red`. For example, if we give your function a tree:
--
2.11.0