184 sprout(tree **ppr, tree_t p_data, int *pi_balance,  in sprout()  argument
195 	if (!*ppr) {  in sprout()
197 		*ppr = (tree *) memget(sizeof(tree));  in sprout()
198 		if (*ppr) {  in sprout()
199 			(*ppr)->left = NULL;  in sprout()
200 			(*ppr)->right = NULL;  in sprout()
201 			(*ppr)->bal = 0;  in sprout()
202 			(*ppr)->data = p_data;  in sprout()
205 		RET(*ppr);  in sprout()
210 	cmp = (*pfi_compare)(p_data, (*ppr)->data);  in sprout()
216 		sub = sprout(&(*ppr)->left, p_data, pi_balance,  in sprout()
220 			switch ((*ppr)->bal) {  in sprout()
224 				(*ppr)->bal = 0;  in sprout()
230 				(*ppr)->bal = -1;  in sprout()
235 				p1 = (*ppr)->left;  in sprout()
238 					(*ppr)->left = p1->right;  in sprout()
239 					p1->right = *ppr;  in sprout()
240 					(*ppr)->bal = 0;  in sprout()
241 					*ppr = p1;  in sprout()
249 					(*ppr)->left = p2->right;  in sprout()
250 					p2->right = *ppr;  in sprout()
253 						(*ppr)->bal = 1;  in sprout()
255 						(*ppr)->bal = 0;  in sprout()
261 					*ppr = p2;  in sprout()
263 				(*ppr)->bal = 0;  in sprout()
274 		sub = sprout(&(*ppr)->right, p_data, pi_balance,  in sprout()
279 			switch ((*ppr)->bal) {  in sprout()
282 				(*ppr)->bal = 0;  in sprout()
287 				(*ppr)->bal = 1;  in sprout()
291 				p1 = (*ppr)->right;  in sprout()
294 					(*ppr)->right = p1->left;  in sprout()
295 					p1->left = *ppr;  in sprout()
296 					(*ppr)->bal = 0;  in sprout()
297 					*ppr = p1;  in sprout()
305 					(*ppr)->right = p2->left;  in sprout()
306 					p2->left = *ppr;  in sprout()
309 						(*ppr)->bal = -1;  in sprout()
311 						(*ppr)->bal = 0;  in sprout()
318 					*ppr = p2;  in sprout()
320 				(*ppr)->bal = 0;  in sprout()
332 		(*pfv_delete)((*ppr)->data);  in sprout()
333 	(*ppr)->data = p_data;  in sprout()
334 	RET(*ppr)  in sprout()