diff --git a/.vs/Dev06_06/FileContentIndex/8095564b-a1b5-452d-9a8a-e940efbe4d83.vsidx b/.vs/Dev06_06/FileContentIndex/8095564b-a1b5-452d-9a8a-e940efbe4d83.vsidx
new file mode 100644
index 0000000..755215c
Binary files /dev/null and b/.vs/Dev06_06/FileContentIndex/8095564b-a1b5-452d-9a8a-e940efbe4d83.vsidx differ
diff --git a/.vs/Dev06_06/FileContentIndex/84b2f919-9d4a-494b-bb71-ee39fde0cb44.vsidx b/.vs/Dev06_06/FileContentIndex/84b2f919-9d4a-494b-bb71-ee39fde0cb44.vsidx
new file mode 100644
index 0000000..2a567be
Binary files /dev/null and b/.vs/Dev06_06/FileContentIndex/84b2f919-9d4a-494b-bb71-ee39fde0cb44.vsidx differ
diff --git a/.vs/Dev06_06/FileContentIndex/9d933a85-e587-44a7-aeb6-4b17905d1224.vsidx b/.vs/Dev06_06/FileContentIndex/9d933a85-e587-44a7-aeb6-4b17905d1224.vsidx
new file mode 100644
index 0000000..b31b7c1
Binary files /dev/null and b/.vs/Dev06_06/FileContentIndex/9d933a85-e587-44a7-aeb6-4b17905d1224.vsidx differ
diff --git a/.vs/Dev06_06/FileContentIndex/de0d14d1-d286-47ae-827c-70d57ba0e35b.vsidx b/.vs/Dev06_06/FileContentIndex/de0d14d1-d286-47ae-827c-70d57ba0e35b.vsidx
new file mode 100644
index 0000000..ef7518c
Binary files /dev/null and b/.vs/Dev06_06/FileContentIndex/de0d14d1-d286-47ae-827c-70d57ba0e35b.vsidx differ
diff --git a/.vs/Dev06_06/FileContentIndex/e12a0bdf-7090-4f0d-aa3c-c22e741ef4e1.vsidx b/.vs/Dev06_06/FileContentIndex/e12a0bdf-7090-4f0d-aa3c-c22e741ef4e1.vsidx
new file mode 100644
index 0000000..0bf8308
Binary files /dev/null and b/.vs/Dev06_06/FileContentIndex/e12a0bdf-7090-4f0d-aa3c-c22e741ef4e1.vsidx differ
diff --git a/.vs/slnx.sqlite b/.vs/slnx.sqlite
new file mode 100644
index 0000000..0b22430
Binary files /dev/null and b/.vs/slnx.sqlite differ
diff --git a/AAD.Tests/TreeNodeTests.cs b/AAD.Tests/TreeNodeTests.cs
index ead960b..951e1f1 100644
--- a/AAD.Tests/TreeNodeTests.cs
+++ b/AAD.Tests/TreeNodeTests.cs
@@ -82,27 +82,28 @@ public class TreeNode<T>
     public T Value { get; }
     public TreeNode<T>? Parent { get; private set; }
     public List<TreeNode<T>> Children { get; }
-
+    private int _level;
     public TreeNode(T value, TreeNode<T>? parent = null)
     {
         Value = value;
         Parent = parent;
         Children = new List<TreeNode<T>>();
+
+        if (Parent != null)
+        {
+            this._level = Parent.Level() + 1;
+        }
+        else
+        {
+            this._level = 0;
+        }
     }
 
     public bool IsRoot => Parent == null;
 
     public int Level()
     {
-        var level = 0;
-        var current = this;
-        while (current.Parent != null)
-        {
-            level++;
-            current = current.Parent;
-        }
-
-        return level;
+        return this._level;
     }
 
     public TreeNode<T> Add(T childValue) =>