/* inorder - in-order binary tree traversal

		Author : Kelly and Pohl, adapted M. Boyd
		Date   : 25-MAY-2004
		File   : inorder.c

		Comments:

*/

#include "tree.h"

void inorder (BTREE root)
{
	if ( root != NULL)
	{
		inorder (root -> left); /* traverse left subtree */
		visitnode (root); /* visit root */
		inorder (root -> right); /* traverse right subtree */
	}
}