Homework/HW07/bin-trees-B.cc
void prettyPrint (nodePtr rootp, int margin) // 
{
    const int INDENTATION = 4;
    
    if (!rootp)
        return;
    
    else
    {
        prettyPrint(rootp->right, margin + INDENTATION);
        
        for (int i = 1; i <= margin; ++i)
            cout << " ";
        
        cout << rootp->datum << endl;
        
        prettyPrint(rootp->left, margin + INDENTATION);
    }
}
/**************************  P R E T T Y   P R I N T  *************************
                                                                           
The following function sends to standard output a list of the integer data
values of the nodes in the binary tree pointed to by "rootp".  The values
are written in such a way as to show the logical structure of the tree.
The parameter "margin" should have a non-negative value, which determines 
the number of blank spaces that will be printed to the left of the root 
of the tree.  If no second argument is used when this function is called,
then the default value 0 will be used (see the function prototype).  
The function is recursive.   Documented and coded by W.Knight. */
P R E T T Y   P R I N T
The following function sends to standard output a list of the integer data
values of the nodes in the binary tree pointed to by "rootp".  The values
are written in such a way as to show the logical structure of the tree.
The parameter "margin" should have a non-negative value, which determines
the number of blank spaces that will be printed to the left of the root
of the tree.  If no second argument is used when this function is called,
then the default value 0 will be used .
The function is recursive.   Documented and coded by W.Knight.
P R E T T Y P R I N T The following function sends to standard output a list of the integer data values of the nodes in the binary tree pointed to by " rootp " . The values are written in such a way as to show the logical structure of the tree . The parameter " margin " should have a non - negative value which determines the number of blank spaces that will be printed to the left of the root of the tree . If no second argument is used when this function is called then the default value 0 will be used . The function is recursive . Documented and coded by W . Knight .
void prettyPrint (nodePtr rootp, int margin) 
{
    const int INDENTATION = 4;
    if (!rootp)
        return;
    else
    {
        prettyPrint(rootp->right, margin + INDENTATION);
        for (int i = 1; i <= margin; ++i)
            cout << " ";
        cout << rootp->datum << endl;
        prettyPrint(rootp->left, margin + INDENTATION);
    }
}
void prettyPrint ( nodePtr rootp , int margin ) { const int INDENTATION = 4 ; if ( ! rootp ) return ; else { prettyPrint ( rootp -> right , margin + INDENTATION ) ; for ( int i = 1 ; i <= margin ; ++ i ) cout << " " ; cout << rootp -> datum << endl ; prettyPrint ( rootp -> left , margin + INDENTATION ) ; } }
P R E T T Y   P R I N T
The following function sends to standard output a list of the integer data
values of the nodes in the binary tree pointed to by "rootp".
P R E T T Y P R I N T The following function sends to standard output a list of the integer data values of the nodes in the binary tree pointed to by " rootp " .
// 