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