From 2c1e1c67d3d9f8a365f37cd20ef72f93f633d63b Mon Sep 17 00:00:00 2001
From: Matt <mcoley2@gmu.edu>
Date: Sat, 14 Sep 2024 18:23:35 -0400
Subject: [PATCH] misc: Improve tree leaves test

---
 src/test/java/software/coley/collections/TreeTest.java | 10 +++++++---
 1 file changed, 7 insertions(+), 3 deletions(-)

diff --git a/src/test/java/software/coley/collections/TreeTest.java b/src/test/java/software/coley/collections/TreeTest.java
index 533fddc..97d1134 100644
--- a/src/test/java/software/coley/collections/TreeTest.java
+++ b/src/test/java/software/coley/collections/TreeTest.java
@@ -7,7 +7,7 @@
 import java.util.List;
 import java.util.Set;
 
-import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.*;
 
 /**
  * Tests for {@link Tree}
@@ -146,7 +146,11 @@ public void test_tree_gets_all_leaves() {
 		tree.putTree("key4", "value4");
 		tree.putTree("key5", "value5");
 		// There are 6 leaves, as key1 has two children
-		Set<Tree<String, String>> foo = tree.getAllLeaves();
-		assertEquals(6, foo.size());
+		Set<Tree<String, String>> leaves = tree.getAllLeaves();
+		assertEquals(6, leaves.size());
+		// Double check parent/child relation
+		Tree<String, String> key1a = sub1.get("key1-a");
+		assertSame(sub1, key1a.getParent());
+		leaves.forEach(t -> assertNotNull(t.getParent()));
 	}
 }