180 sprout(tree **ppr, tree_t p_data, int *pi_balance,  in sprout()  argument
191 	if (!*ppr) {  in sprout()
193 		*ppr = (tree *) memget(sizeof(tree));  in sprout()
194 		if (*ppr) {  in sprout()
195 			(*ppr)->left = NULL;  in sprout()
196 			(*ppr)->right = NULL;  in sprout()
197 			(*ppr)->bal = 0;  in sprout()
198 			(*ppr)->data = p_data;  in sprout()
201 		RET(*ppr);  in sprout()
206 	cmp = (*pfi_compare)(p_data, (*ppr)->data);  in sprout()
212 		sub = sprout(&(*ppr)->left, p_data, pi_balance,  in sprout()
216 			switch ((*ppr)->bal) {  in sprout()
220 				(*ppr)->bal = 0;  in sprout()
226 				(*ppr)->bal = -1;  in sprout()
231 				p1 = (*ppr)->left;  in sprout()
234 					(*ppr)->left = p1->right;  in sprout()
235 					p1->right = *ppr;  in sprout()
236 					(*ppr)->bal = 0;  in sprout()
237 					*ppr = p1;  in sprout()
245 					(*ppr)->left = p2->right;  in sprout()
246 					p2->right = *ppr;  in sprout()
249 						(*ppr)->bal = 1;  in sprout()
251 						(*ppr)->bal = 0;  in sprout()
257 					*ppr = p2;  in sprout()
259 				(*ppr)->bal = 0;  in sprout()
270 		sub = sprout(&(*ppr)->right, p_data, pi_balance,  in sprout()
275 			switch ((*ppr)->bal) {  in sprout()
278 				(*ppr)->bal = 0;  in sprout()
283 				(*ppr)->bal = 1;  in sprout()
287 				p1 = (*ppr)->right;  in sprout()
290 					(*ppr)->right = p1->left;  in sprout()
291 					p1->left = *ppr;  in sprout()
292 					(*ppr)->bal = 0;  in sprout()
293 					*ppr = p1;  in sprout()
301 					(*ppr)->right = p2->left;  in sprout()
302 					p2->left = *ppr;  in sprout()
305 						(*ppr)->bal = -1;  in sprout()
307 						(*ppr)->bal = 0;  in sprout()
314 					*ppr = p2;  in sprout()
316 				(*ppr)->bal = 0;  in sprout()
328 		(*pfv_delete)((*ppr)->data);  in sprout()
329 	(*ppr)->data = p_data;  in sprout()
330 	RET(*ppr)  in sprout()