hard tree question

[spanky]

i've writen a program that prints a list of words to a file. it uses an avl tree for balancing.

could some please tell me why my height function doesn't work and why the produced file doesn't have any words in it.

thanks.

<please see attached file>

[Hammer]

>if ( avl != NULL );
This has no affect, as you've left an extra semi-colon on the end by mistake.

>main() needs a return code even if avl == NULL.

>int max(int a, int b)
My compiler complains about this. I guess there's already a function called max, so I suggest you rename it. Also, it needs a prototype.
[edit] max() is in stdlib.h, and is a macro:

#include <stdlib.h>
#define max(a,b)  (((a) > (b)) ? (a) : (b))

[/edit]
>tolower()
you do realise this only does one character?

[Hammer]

Also, you're not storing the pointer of the list:
>insert(word, avl);
You'll need to store it, something like this (depending on how your insert function is working).
>avl = insert(word, avl);

It still doesn't work properly, but I don't have time to help out at present.... <sorry>

[spanky]

thanks hammer.
i've made those corrections. its now printing to the file - but only the the last word several times - hey, were getting there!! ta.