Project/Real_code/book/ch14/ch14-tsearch.c
void print_emp(const void *nodep, const VISIT which, const int depth)
{
	struct employee *e = *((struct employee **) nodep);

	switch (which) {
	case leaf:
	case postorder:
		printf("Depth: %d. Employee:\n", depth);
		printf("\t%s, %s\t%d\t%s\n", e->lastname, e->firstname,
			e->emp_id, ctime(& e->start_date));
		break;
	default:
		break;
	}
}
/* print_emp --- print an employee structure during a tree walk */
print an employee structure during a tree walk
print an employee structure during a tree walk
void print_emp(const void *nodep, const VISIT which, const int depth)
{
	struct employee *e = *((struct employee **) nodep);
	switch (which) {
	case leaf:
	case postorder:
		printf("Depth: %d. Employee:\n", depth);
		printf("\t%s, %s\t%d\t%s\n", e->lastname, e->firstname,
			e->emp_id, ctime(& e->start_date));
		break;
	default:
		break;
	}
}
void print_emp ( const void * nodep , const VISIT which , const int depth ) { struct employee * e = * ( ( struct employee * * ) nodep ) ; switch ( which ) { case leaf : case postorder : printf ( " \n " , depth ) ; printf ( " \t \t \t \n " , e -> lastname , e -> firstname , e -> emp_id , ctime ( & e -> start_date ) ) ; break ; default : break ; } }
print_emp --- print an employee structure during a tree walk
print_emp --- print an employee structure during a tree walk