Consider the following pseudo-code, which indicates part of
a standard binary tree algorithm.
print( node )
{
if( there is a left child ) print( left child );
print data;
if( there is a right child ) print( right child );
}
Which of the following is the standard name for this
algorithm?