145 tree_delete(tree **ppr_p, int (*pfi_compare)(tree_t, tree_t),  in tree_delete()  argument
151 	RET(delete(ppr_p, pfi_compare, p_user, pfv_uar,  in tree_delete()
340 delete(tree **ppr_p, int (*pfi_compare)(tree_t, tree_t), tree_t p_user,  in delete()  argument
348 	if (*ppr_p == NULL) {  in delete()
353 	i_comp = (*pfi_compare)((*ppr_p)->data, p_user);  in delete()
356 		i_ret = delete(&(*ppr_p)->left, pfi_compare, p_user, pfv_uar,  in delete()
359 			bal_L(ppr_p, pi_balance);  in delete()
362 		i_ret = delete(&(*ppr_p)->right, pfi_compare, p_user, pfv_uar,  in delete()
365 			bal_R(ppr_p, pi_balance);  in delete()
368 		pr_q = *ppr_p;  in delete()
371 			*ppr_p = pr_q->left;  in delete()
375 			*ppr_p = pr_q->right;  in delete()
382 				bal_L(ppr_p, pi_balance);  in delete()
418 bal_L(tree **ppr_p, int *pi_balance) {  in bal_L()  argument
425 	switch ((*ppr_p)->bal) {  in bal_L()
428 		(*ppr_p)->bal = 0;  in bal_L()
432 		(*ppr_p)->bal = 1;  in bal_L()
437 		p1 = (*ppr_p)->right;  in bal_L()
441 			(*ppr_p)->right = p1->left;  in bal_L()
442 			p1->left = *ppr_p;  in bal_L()
445 				(*ppr_p)->bal = 1;  in bal_L()
450 				(*ppr_p)->bal = 0;  in bal_L()
453 			*ppr_p = p1;  in bal_L()
460 			(*ppr_p)->right = p2->left;  in bal_L()
461 			p2->left = *ppr_p;  in bal_L()
463 				(*ppr_p)->bal = -1;  in bal_L()
465 				(*ppr_p)->bal = 0;  in bal_L()
470 			*ppr_p = p2;  in bal_L()
478 bal_R(tree **ppr_p, int *pi_balance) {  in bal_R()  argument
484 	switch ((*ppr_p)->bal) {  in bal_R()
487 		(*ppr_p)->bal = 0;  in bal_R()
491 		(*ppr_p)->bal = -1;  in bal_R()
496 		p1 = (*ppr_p)->left;  in bal_R()
500 			(*ppr_p)->left = p1->right;  in bal_R()
501 			p1->right = *ppr_p;  in bal_R()
504 				(*ppr_p)->bal = -1;  in bal_R()
509 				(*ppr_p)->bal = 0;  in bal_R()
512 			*ppr_p = p1;  in bal_R()
519 			(*ppr_p)->left = p2->right;  in bal_R()
520 			p2->right = *ppr_p;  in bal_R()
522 				(*ppr_p)->bal = 1;  in bal_R()
524 				(*ppr_p)->bal = 0;  in bal_R()
529 			*ppr_p = p2;  in bal_R()