syncted tests.toml and regnerated test cases.

Author: BethanyG

exercises/practice/satellite/.meta/tests.toml

@@ -1,6 +1,13 @@
-# This is an auto-generated file. Regular comments will be removed when this
-# file is regenerated. Regenerating will not touch any manually added keys,
-# so comments can be added in a "comment" key.
+# This is an auto-generated file.
+#
+# Regenerating this file via `configlet sync` will:
+# - Recreate every `description` key/value pair
+# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications
+# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion)
+# - Preserve any other key/value pair
+#
+# As user-added comments (using the # character) will be removed when this file
+# is regenerated, comments can be added via a `comment` key.
 
 [8df3fa26-811a-4165-9286-ff9ac0850d19]
 description = "Empty tree"
@@ -19,3 +26,12 @@ description = "Reject inconsistent traversals of same length"
 
 [d86a3d72-76a9-43b5-9d3a-e64cb1216035]
 description = "Reject traversals with repeated items"
+
+[af31ae02-7e5b-4452-a990-bccb3fca9148]
+description = "A degenerate binary tree"
+
+[ee54463d-a719-4aae-ade4-190d30ce7320]
+description = "Another degenerate binary tree"
+
+[87123c08-c155-4486-90a4-e2f75b0f3e8f]
+description = "Tree with many more items"

exercises/practice/satellite/satellite_test.py

@@ -1,6 +1,6 @@
 # These tests are auto-generated with test data from:
 # https://github.com/exercism/problem-specifications/tree/main/exercises/satellite/canonical-data.json
-# File last updated on 2023-07-19
+# File last updated on 2025-12-30
 
 import unittest
 
@@ -67,3 +67,56 @@ def test_reject_traversals_with_repeated_items(self):
             tree_from_traversals(preorder, inorder)
         self.assertEqual(type(err.exception), ValueError)
         self.assertEqual(err.exception.args[0], "traversals must contain unique items")
+
+    def test_a_degenerate_binary_tree(self):
+        preorder = ["a", "b", "c", "d"]
+        inorder = ["d", "c", "b", "a"]
+
+        expected = {
+            "v": "a",
+            "l": {
+                "v": "b",
+                "l": {"v": "c", "l": {"v": "d", "l": {}, "r": {}}, "r": {}},
+                "r": {},
+            },
+            "r": {},
+        }
+        self.assertEqual(tree_from_traversals(preorder, inorder), expected)
+
+    def test_another_degenerate_binary_tree(self):
+        preorder = ["a", "b", "c", "d"]
+        inorder = ["a", "b", "c", "d"]
+
+        expected = {
+            "v": "a",
+            "l": {},
+            "r": {
+                "v": "b",
+                "l": {},
+                "r": {"v": "c", "l": {}, "r": {"v": "d", "l": {}, "r": {}}},
+            },
+        }
+        self.assertEqual(tree_from_traversals(preorder, inorder), expected)
+
+    def test_tree_with_many_more_items(self):
+        preorder = ["a", "b", "d", "g", "h", "c", "e", "f", "i"]
+        inorder = ["g", "d", "h", "b", "a", "e", "c", "i", "f"]
+
+        expected = {
+            "v": "a",
+            "l": {
+                "v": "b",
+                "l": {
+                    "v": "d",
+                    "l": {"v": "g", "l": {}, "r": {}},
+                    "r": {"v": "h", "l": {}, "r": {}},
+                },
+                "r": {},
+            },
+            "r": {
+                "v": "c",
+                "l": {"v": "e", "l": {}, "r": {}},
+                "r": {"v": "f", "l": {"v": "i", "l": {}, "r": {}}, "r": {}},
+            },
+        }
+        self.assertEqual(tree_from_traversals(preorder, inorder), expected)