对匹配的存储过程 [英] store procedure for pair matching

问题描述

我正在为1个网站进行多层次营销

这里的概念是，如果A在左边添加两个人B，在右边添加c，那么A将获得佣金.仅当左，右成员的双方都被添加时，其他人才能获得佣金.
如果B在他的左侧和右侧添加了2个人，则B将获得佣金，但A将获得佣金，直到添加C的左右成员为止.
这个过程继续进行..所以我想为其编写存储过程，以便当添加B和C子对象时A将获得佣金.请帮助

i m doing 1 website for multilevel marketing

there concept is if A add two person B on left and c on right then A will get commission. only if both his side that is left and right member are added else on commission.
And if B have added 2 person on his left and right B will get commission but A will get commission until C''s Left and Right members are added.
this process goes on.. so i want to write store procedure for it so that A will get commission when B and C childs are added. Please Help

推荐答案

这篇关于对匹配的存储过程的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！