my main idea that i can think of is building a recursive function for each suntree of T and because i was told that all the subroots are zeros then if i get an object in which we have null in both the right and the left of its "sub objects"
i dont know if i did it correctly can you tell me if i got my purpose in this code??
Short of time or not, you should at least try compiling the code. That would only take you a few seconds whereas soliciting answers here will take much longer than that.
(Hint: your code won't compile.)
The fact that you made the choice to post rather than to compile indicates, to me at least, the reason you're short of time. You just aren't managing your time well.
Joined: Feb 01, 2008
ok want to try my code
how do i build a binary tree to test my code on ??
personally i prefer to know where is my logical problem with the code cause i think i have done it ok ?? [ February 18, 2008: Message edited by: donaldth smithts ] [ February 18, 2008: Message edited by: donaldth smithts ]
Joined: Aug 05, 2005
Seems like the OP found time to compile his code here