--- a/AATree.st	Fri Oct 14 00:09:41 2016 +0200
+++ b/AATree.st	Fri Oct 14 00:09:43 2016 +0200
@@ -52,11 +52,19 @@
         Thus providing a more predictable performance 
         (within a factor of 2, as opposed to a much wider range for sortedCollections)
 
+    [instance variables:]
+        treeRoot             TreeNode        the top node
+        sortBlock            Block           sorter; 
+                                             gets two args a,b and should return true if a is
+                                             to come before b in the collection    
+
     [author:]
         Original algorithm by Arne Andersson
         ported from wikipedia to Smalltalk code by Claus Gittinger
 
     [see also:]
+        BTree
+        SortedCollection
         https://en.wikipedia.org/wiki/AA_tree
 "
 !