Salam i want to write a binary tree code with left and right child my question is that when one left side and one right side child complete then system credit 700 to parent id plz any body from this forum can help me? i am thankfull to you its urgently

when one left side and one right side child complete then system credit 700 to parent id

I don't understand your question. Do you mean when a node has two children, 700 is added to a value in the node?

Show code please. This is basic computer science stuff.

yes this will help you to understand my question TEST.png

can any one help me? plz help me urgently