binary tree

  • Marketing plan details

    refer :see marketing plan details image

    every child has reference id of parent id

    for eg:

    B has reference ID of A’s ID

    if a person join his sponser gets 5pv points

    if E join new person below him

    E gets 5 pv

    C gets 5 pv

    B gets 5 pv

    A gets 5 pv

    The very1st payment has to release when they have tail like this

    refer :see first payment release image

    The payment Calulation Method

    refer :see payment calculation image

    Calculation for A alone

    A has tail so the payment has to release to A

    A has right side 25 pv and in left side 20 pv

    Only Pair matches

    For 20 PV only the payment has to release

    A has 5 pv remaining in right side.This has to carry forward to

    next payment

    suppose next time payment of A has 20pv in right and 15 in left

    20 pv +previous 5 pv in right

    15 pv in left

    A ‘s right has 25pv and in left 15 pv

    pair matches

    for 15 pv only payment has to release

    remaining 10 pv in right has to add to next payment

    Now for B we calculate

    B also has tail so payment has to release

    B has 15 pv in right and 10 pv in left

    Pair matches

    Only 10 pv payment has to be given

    Remaining 5 pv should be carried forward

    Now for D we calculate

    D has 5 pv in right and 5 pv in left

    Pair matches

    Right side 5 pv = 5pv left

    Even if pair matches payment should not be given because D does nt have tail

    Likewise we have to calculate anna

    One more thing

    Pv limit for a payment will be 500pv

    Even if they reache 1000 pv left side and right side

    Payment must be given for 500pv remaining will be deleted

    In case

    A has 1200pv in right and 1000pv in left

    Pair matches

    1000pv right = 1000pv left => only 500pv will be taken into account.Remaining 500pv will have to be deleted

    after pair matches A will have 200pv extra in right side that will have to be carried forward to the next payment

    if you are not clear please see the attachment project plan details attachment

  • Are you looking to build the compensation plan, just calculate PV, or build the binary tree? Or are you looking for somebody to do all of that for you?

    Jason...AKA CirqueDeSQLeil
    _______________________________________________
    I have given a name to my pain...MCM SQL Server, MVP
    SQL RNNR
    Posting Performance Based Questions - Gail Shaw[/url]
    Learn Extended Events

  • i am looking for the coding i am a developer

  • The code for which one of those areas that I listed?

    Can you provide samples of what you have done so far?

    Jason...AKA CirqueDeSQLeil
    _______________________________________________
    I have given a name to my pain...MCM SQL Server, MVP
    SQL RNNR
    Posting Performance Based Questions - Gail Shaw[/url]
    Learn Extended Events

  • i didnt yet start i dont even know how to start

  • I recommend you hire a consultant to help you with it. The compensation plan, IMO, would be best done in a .Net language. The PV calculation would need to be calculated in order to figure out the compensation plan. In order to calculate PV, you have to build your binary tree. The binary tree could be done in TSQL, while the PV calculation may need to be done in both languages in order to cover different requirements (i.e. calculate the compensation plan or simply display current pv based on a cached tree).

    All of this is far more than just a simple exchange through the forums.

    Jason...AKA CirqueDeSQLeil
    _______________________________________________
    I have given a name to my pain...MCM SQL Server, MVP
    SQL RNNR
    Posting Performance Based Questions - Gail Shaw[/url]
    Learn Extended Events

Viewing 6 posts - 1 through 6 (of 6 total)

You must be logged in to reply to this topic. Login to reply