Recursion Diagram for Hanoi1 Example with 2 Disks

Let hnABC be an abbreviation for hanoi(n, "A", "B", "C").
The output always comes between the first (left) recursive 
and second (right) recursive calls.

          Recursion Tree       Activations, Terminations
              h2ABC            and Outputs.
             /     \
            / AtoB  \          h2ABC Activated   
           /         \         h1ACB Activated
        h1ACB      h1CBA       h0ABC Activated
       /AtoC \    /CtoA \      h0ABC Terminated
    h0ABC h0BCA h0CAB  h0ABC   Output A to C
                               h0BCA Activated
                               h0BCA Terminated
                               h1ACB Terminated 
                               Output A to B
                               h1CBA Activated
                               h0CAB Activated
                               h0CAB Terminated
                               Output C to A
                               h0ABC Activated
                               h0ABC Terminated
                               h1CBA Terminated
                               h2ABC Terminated