Binary tree problem
I have 3 levele binary tree.a is root person.b,c are under the a.d,e are under b.f,g are under c.If any child persons buy some thing,2nd level persons means b,c and first person a will get some profit.left side profit and right side profit is 10,we have to take it as 1 pair.left side,right side profit is 20,we have to take 2pairs.after 6 pairs we have to create to one e-card.How to implement this.If any one have an idea,plz give immediate response.its very urgent.
Users Browsing this Thread
There are currently 1 users browsing this thread. (0 members and 1 guests)