From 3d6f1354843614dedc504e3a5e79ebb5e15783ed Mon Sep 17 00:00:00 2001 From: habere-et-dispertire Date: Wed, 7 Jun 2023 12:20:59 +0100 Subject: [PATCH 1/6] Added four SVG graphs --- exercises/binary-search-tree/description.md | 30 +++++++++------------ 1 file changed, 13 insertions(+), 17 deletions(-) diff --git a/exercises/binary-search-tree/description.md b/exercises/binary-search-tree/description.md index bbfcad82b0..d51d4e4c55 100644 --- a/exercises/binary-search-tree/description.md +++ b/exercises/binary-search-tree/description.md @@ -19,29 +19,25 @@ All data in the left subtree is less than or equal to the current node's data, a For example, if we had a node containing the data 4, and we added the data 2, our tree would look like this: - 4 - / - 2 +[A graph with root node 4 and a single child node 2.][4-2] If we then added 6, it would look like this: - 4 - / \ - 2 6 +[A graph with root node 4 and two child nodes 2 and 6.][4-2-6] If we then added 3, it would look like this - 4 - / \ - 2 6 - \ - 3 +[A graph with root node 4, two child nodes 2 and 6, and a grandchild node 3.][4-2-6-3] And if we then added 1, 5, and 7, it would look like this - 4 - / \ - / \ - 2 6 - / \ / \ - 1 3 5 7 +[A graph with root node 4, two child nodes 2 and 6, and four grandchild nodes 1, 3, 5 and 7.][4-2-6-1-3-5-7] + +## Credit + +The graphs are made by [habere-et-dispertire](https://exercism.org/profiles/habere-et-dispertire) using [PGF/TikZ](https://en.wikipedia.org/wiki/PGF/TikZ) by Till Tantau. + +[4-2]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/4-2.svg +[4-2-6]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/4-2-6.svg +[4-2-6-3]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/4-2-6-3.svg +[4-2-6-1-3-5-7]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/4-2-6-1-3-5-7.svg From 5a6c9093c8660015ee38ef7e116de724739e480d Mon Sep 17 00:00:00 2001 From: habere-et-dispertire Date: Wed, 7 Jun 2023 12:40:08 +0100 Subject: [PATCH 2/6] [typo] Add missing "tree-" filename prefixes --- exercises/binary-search-tree/description.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/exercises/binary-search-tree/description.md b/exercises/binary-search-tree/description.md index d51d4e4c55..f25ad71772 100644 --- a/exercises/binary-search-tree/description.md +++ b/exercises/binary-search-tree/description.md @@ -37,7 +37,7 @@ And if we then added 1, 5, and 7, it would look like this The graphs are made by [habere-et-dispertire](https://exercism.org/profiles/habere-et-dispertire) using [PGF/TikZ](https://en.wikipedia.org/wiki/PGF/TikZ) by Till Tantau. -[4-2]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/4-2.svg -[4-2-6]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/4-2-6.svg -[4-2-6-3]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/4-2-6-3.svg -[4-2-6-1-3-5-7]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/4-2-6-1-3-5-7.svg +[4-2]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2.svg +[4-2-6]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6.svg +[4-2-6-3]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6-3.svg +[4-2-6-1-3-5-7]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6-1-3-5-7.svg From cc3ed95469ece71377a9d989ab4988d595d4b9d3 Mon Sep 17 00:00:00 2001 From: habere-et-dispertire Date: Wed, 7 Jun 2023 16:35:04 +0100 Subject: [PATCH 3/6] Update exercises/binary-search-tree/description.md Co-authored-by: Jeremy Walker --- exercises/binary-search-tree/description.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/binary-search-tree/description.md b/exercises/binary-search-tree/description.md index f25ad71772..2567b5e3db 100644 --- a/exercises/binary-search-tree/description.md +++ b/exercises/binary-search-tree/description.md @@ -35,7 +35,7 @@ And if we then added 1, 5, and 7, it would look like this ## Credit -The graphs are made by [habere-et-dispertire](https://exercism.org/profiles/habere-et-dispertire) using [PGF/TikZ](https://en.wikipedia.org/wiki/PGF/TikZ) by Till Tantau. +The images were created by [habere-et-dispertire](https://exercism.org/profiles/habere-et-dispertire) using [PGF/TikZ](https://en.wikipedia.org/wiki/PGF/TikZ) by Till Tantau. [4-2]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2.svg [4-2-6]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6.svg From 0aa0eaaae72a14d4accc0b1b053f94db2773da03 Mon Sep 17 00:00:00 2001 From: habere-et-dispertire Date: Wed, 9 Aug 2023 13:12:39 +0100 Subject: [PATCH 4/6] Move images inline --- exercises/binary-search-tree/description.md | 13 ++++--------- 1 file changed, 4 insertions(+), 9 deletions(-) diff --git a/exercises/binary-search-tree/description.md b/exercises/binary-search-tree/description.md index 2567b5e3db..2e287d6ac2 100644 --- a/exercises/binary-search-tree/description.md +++ b/exercises/binary-search-tree/description.md @@ -19,25 +19,20 @@ All data in the left subtree is less than or equal to the current node's data, a For example, if we had a node containing the data 4, and we added the data 2, our tree would look like this: -[A graph with root node 4 and a single child node 2.][4-2] +![A graph with root node 4 and a single child node 2.](https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2.svg) If we then added 6, it would look like this: -[A graph with root node 4 and two child nodes 2 and 6.][4-2-6] +![A graph with root node 4 and two child nodes 2 and 6.](https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6.svg) If we then added 3, it would look like this -[A graph with root node 4, two child nodes 2 and 6, and a grandchild node 3.][4-2-6-3] +![A graph with root node 4, two child nodes 2 and 6, and a grandchild node 3.](https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6-3.svg) And if we then added 1, 5, and 7, it would look like this -[A graph with root node 4, two child nodes 2 and 6, and four grandchild nodes 1, 3, 5 and 7.][4-2-6-1-3-5-7] +![A graph with root node 4, two child nodes 2 and 6, and four grandchild nodes 1, 3, 5 and 7.](https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6-1-3-5-7.svg) ## Credit The images were created by [habere-et-dispertire](https://exercism.org/profiles/habere-et-dispertire) using [PGF/TikZ](https://en.wikipedia.org/wiki/PGF/TikZ) by Till Tantau. - -[4-2]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2.svg -[4-2-6]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6.svg -[4-2-6-3]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6-3.svg -[4-2-6-1-3-5-7]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6-1-3-5-7.svg From 085127b02ce76bd64d92eb175d39e43e7b9c170a Mon Sep 17 00:00:00 2001 From: habere-et-dispertire Date: Wed, 9 Aug 2023 14:04:21 +0100 Subject: [PATCH 5/6] Moved non-inline links --- exercises/binary-search-tree/description.md | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/exercises/binary-search-tree/description.md b/exercises/binary-search-tree/description.md index 2e287d6ac2..d30ca33ad9 100644 --- a/exercises/binary-search-tree/description.md +++ b/exercises/binary-search-tree/description.md @@ -35,4 +35,7 @@ And if we then added 1, 5, and 7, it would look like this ## Credit -The images were created by [habere-et-dispertire](https://exercism.org/profiles/habere-et-dispertire) using [PGF/TikZ](https://en.wikipedia.org/wiki/PGF/TikZ) by Till Tantau. +The images were created by [habere-et-dispertire][habere-et-dispertire] using [PGF/TikZ][pgf-tikz] by Till Tantau. + +[habere-et-dispertire]: https://exercism.org/profiles/habere-et-dispertire +[pgf-tikz]: https://en.wikipedia.org/wiki/PGF/TikZ From 36a74294bd072cdb79acbc6338d3348780971b39 Mon Sep 17 00:00:00 2001 From: habere-et-dispertire Date: Thu, 17 Aug 2023 00:42:32 +0100 Subject: [PATCH 6/6] Switch to assets.exercism.org --- exercises/binary-search-tree/description.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/exercises/binary-search-tree/description.md b/exercises/binary-search-tree/description.md index d30ca33ad9..f49145c50e 100644 --- a/exercises/binary-search-tree/description.md +++ b/exercises/binary-search-tree/description.md @@ -19,19 +19,19 @@ All data in the left subtree is less than or equal to the current node's data, a For example, if we had a node containing the data 4, and we added the data 2, our tree would look like this: -![A graph with root node 4 and a single child node 2.](https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2.svg) +![A graph with root node 4 and a single child node 2.](https://assets.exercism.org/images/exercises/binary-search-tree/tree-4-2.svg) If we then added 6, it would look like this: -![A graph with root node 4 and two child nodes 2 and 6.](https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6.svg) +![A graph with root node 4 and two child nodes 2 and 6.](https://assets.exercism.org/images/exercises/binary-search-tree/tree-4-2-6.svg) If we then added 3, it would look like this -![A graph with root node 4, two child nodes 2 and 6, and a grandchild node 3.](https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6-3.svg) +![A graph with root node 4, two child nodes 2 and 6, and a grandchild node 3.](https://assets.exercism.org/images/exercises/binary-search-tree/tree-4-2-6-3.svg) And if we then added 1, 5, and 7, it would look like this -![A graph with root node 4, two child nodes 2 and 6, and four grandchild nodes 1, 3, 5 and 7.](https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/binary-search-tree/tree-4-2-6-1-3-5-7.svg) +![A graph with root node 4, two child nodes 2 and 6, and four grandchild nodes 1, 3, 5 and 7.](https://assets.exercism.org/images/exercises/binary-search-tree/tree-4-2-6-1-3-5-7.svg) ## Credit