binary trees

Hello all
I just needed some direction to creating the following funtions in C using recurrsion:

*width of a binary tree
*making each node of a tree 0 (zero)
*make a mirror of the tree
*bringing two trees together

I've decided that I need to use pointers and a record with the following fields:
*left
*right
*leaf (node)

ANY help would be very much appreciated!!!
Thanx in advance

You're lucky I'm not a moderator. I'd delete this thread. You want direction? How about reading the directions for the forum itself? While you're at it, read the FAQ. Then, in your spare time, how about using the search button to search for binary trees?

Once you've done all of that, then, as per the forum rules, post your problem and specifics as per the forum rules, and you'll get much more help.

Quzah.

:rolleyes:
hmm...you should have a try to do your own programming. if error, you may ask, but not asking the answer!

quzah is on a rampage, :mad::mad: but unfortunately i'd have to agree

:mad: :D anyway, quzah was right. dont you think ppl will do think kind of question? sigh, even that person didn't have a try...

other than that, that person also dont know anythings after he/she got the answer. coz he/she didn't do anythings, so how he/she improve the C knowledge..

yeah, like you said, you have to do your own work. i dont mind TRYING(cuz i suck) to help someone out w/their code, but if you dont even try LOL i mean come on!!?!!

:D no code, no helping hand. is it ?? LOL

ok...will do...thanx a lot

ouch, dont be such as sad person. at lease you get ideal - do a bit of programming accordingly to your question. we will try to fix the error or comment to you. so, be happy ok ?:p