AVL terminology

Author: lee-naish

src/algorithms/explanations/AVLExp.md

@@ -11,6 +11,9 @@ this background.
 
 A **binary search tree (BST)** is either empty or else it is a root
 node containing a key and two subtrees, which are binary search trees.
+We refer to these as t.key, t.left and t.right, respectively (typically
+t is represented as *a pointer to* a record and these are the fields
+of the record *pointed to* by t).
 Binary trees are ordered, so keys in the left subtree are smaller (or
 equal to) the key in the root and keys in the right subtree are greater
 (or equal to).  Normally there is additional data in each node as well

src/algorithms/pseudocode/AVLTreeInsertion.js

@@ -43,8 +43,9 @@ AVLT_Insert(t, k) // returns t with key k inserted \\B AVLT_Insert(t, k)
       //Both subtrees are Empty and the height is 1
       create new node n containing k \\B create new node
 \\Note}
-      return new node containing k \\B return n
-      \\Expl{ Return a single-node tree with key k (the height is 1).
+      return a single-node tree containing k \\B return n
+      \\Expl{ Both subtrees are Empty and its height is 1.
+              New memory will need to be allocated for it.
               This is the base case of the recursion.
       \\Expl}
     \\In}