Search:

ah, that does make a lot more sense... Thanks a lot :]

oh okay, so does that mean newNode creates a new node called "node" when I call it?

so it should be

[code] insert(node, newValue); [\code]

?

I recall doing that and I think I got an...

but I typedefed tree to be a pointer to a node, and since I created a node using newNode. so Shouldn't I be inserting a Node I want to insert the value in? which in this case is newNode?

thanks...

Hi there I'm trying to practice trees, and I'm not quite sure how I should implement my main function, although I'm pretty sure My other functions are correct... I could be wrong though :x

...

ok sweet thanks for the help guys

ok maybe I shouldn't call it a loop :x it's 3:30AM and I'm having trouble concentrating :P



this is whats confusing me, how does it have the chance to print testY and n%2 when it's calling...

oh I think i get it now, so for each loop (3 in this case), it will "// print the least significant bit" the same amount of times as loops? which is why theres 3 testY's?

Hey there guys :)

I've got a sample code on converting numbers into binary by using recursions

heres the function:


void printBinary (int n) {
if (n < 2) {
printf ("%d ", n);