diff --git a/Quadtree.cs b/Quadtree.cs
index 1709e1b..99a7869 100644
--- a/Quadtree.cs
+++ b/Quadtree.cs
@@ -9,14 +9,14 @@ namespace Quadtree
     ///   advance, instead the boundaries will be determined dynamically as objects are added.</para>
     ///   <para>Objects are expected to have similar size, and to be somewhat small in relation to the distances in
     ///   between them. This allows simple queries. If very large objects would have to be stored, it could become
-    ///   necessary to store objects not in a single leaf, but in each leaf they overlap.</para>
+    ///   necessary to store objects not in a single leaf, but in each leaf they intersect with.</para>
     /// </summary>
-    /// <typeparam name="T">Type of the reference to a world object.</typeparam>
     // TODO: Support for moving objects without having to remove and re-add them.
     // TODO: Add method to prune empty leaves. An empty leaf is not removed automatically when its last object is removed.
     // TODO: Add unit tests.
     public class Quadtree
     {
+        // TODO: It should be possible to calculate whether average query time will be better with or without split, without resorting to max leaf size and max tree depth.
         /// <summary>
         /// Maximum number of items in a leaf vertex before it is split, unless the depth of the leaf is greater or
         /// equal to the maximum tree depth.