9. Print a data from a binary tree – In-order(ascending)

// recursive version

Void PrintTree ( struct * node node )

{

  if ( node == NULL )

                                 return;

 PrintTree(node->left );

 Printf(“%d”, node->data);

 PrintTree(node->right );

}