Homework/HW07/bin-trees-B.cc
bool isHeightBalanced (nodePtr rootp)
{
    //This function is converted into a driver function for testHeightBalanced.

    //In this case, height is basically just a dummy variable not used for anything except to give
    //the testHeightBalanced function something to use to keep track of the height of the table.
    int height = 0;
    return testHeightBalanced(rootp, height);
}
/*******************  I S   H E I G H T   B A L A N C E D  ******************

This function determines whether the binary tree pointed to by "rootp"
is height balanced, by which we mean that every node in the tree has this
property:  the heights of its left and right subtrees differ by at most 1.
The function documentation and heading were written by W. Knight.  
See the third version of the function isPerfect for implementation ideas. 
*/
I S   H E I G H T   B A L A N C E D
This function determines whether the binary tree pointed to by "rootp"
is height balanced, by which we mean that every node in the tree has this
property:  the heights of its left and right subtrees differ by at most 1.
The function documentation and heading were written by W. Knight.
See the third version of the function isPerfect for implementation ideas.
I S H E I G H T B A L A N C E D This function determines whether the binary tree pointed to by " rootp " is height balanced by which we mean that every node in the tree has this property : the heights of its left and right subtrees differ by at most 1 . The function documentation and heading were written by W . Knight . See the third version of the function isPerfect for implementation ideas .
bool isHeightBalanced (nodePtr rootp)
{
    int height = 0;
    return testHeightBalanced(rootp, height);
}
bool isHeightBalanced ( nodePtr rootp ) { int height = 0 ; return testHeightBalanced ( rootp , height ) ; }
I S   H E I G H T   B A L A N C E D
This function determines whether the binary tree pointed to by "rootp"
is height balanced, by which we mean that every node in the tree has this
property:  the heights of its left and right subtrees differ by at most 1.
I S H E I G H T B A L A N C E D This function determines whether the binary tree pointed to by " rootp " is height balanced by which we mean that every node in the tree has this property : the heights of its left and right subtrees differ by at most 1 .
//This function is converted into a driver function for testHeightBalanced. //In this case, height is basically just a dummy variable not used for anything except to give //the testHeightBalanced function something to use to keep track of the height of the table.