anchor.diff:  RETURN:  a list (n' l' x' y') for the next brother subtree.
   "
     (if (null (cdr tree))
  -      (apply 'tree-diagram-generate-node (list n l x y (car tree)))
  -      (let ((inc (apply 'tree-diagram-generate-inherit
  -                        (apply 'tree-diagram-generate-node
  -                               (list n l x y (car tree))))))
  +      (tree-diagram-generate-node n l x y (car tree))
  +      (let ((inc (apply (function tree-diagram-generate-inherit)
  +                        (tree-diagram-generate-node n l x y (car tree)))))
           (do ((subtrees (cdr tree) (cdr subtrees)))	((null subtrees))
  -          (setq inc (apply 'tree-diagram-generate-tree 
  +          (setq inc (apply (function tree-diagram-generate-tree) 
                              (append inc (list (car subtrees))))))
  -        (tree-diagram-generate-adjust-x inc)))) ;;TREE-DIAGRAM-GENERATE-TREE
  +        (tree-diagram-generate-adjust-x inc))))
   
   
   (defun tree-to-diagram (tree)
  
positive.code:       (random most-positive-fixnum)
        (loop for i from 0 below (random (1+ width))
           collect (tree-generate-random (1- depth) width) into children
           finally (return (cons (random most-positive-fixnum) children))))
    ) ;;TREE-GENERATE-RANDOM
  
  
  ;; (insert (tree-to-ascii (generate-random-tree 7 3)))
  
negative.code: PRE:    tree is a cons of the node and the list of children.
  DOES:   writes to the *standard-output* the Diagram file text.
  "
    (tree-diagram-generate-tree 1000 60 45 27 tree))
  
  
  (defun tree-depth (tree)
  