Search:

Thanks! That's why it kept reseting. As to current, I want to do it as following. I have a new node, if there is no root, that new node is now root. If there is a root, I set current equal to it and...

Thanks, but it's still reseting root to be the new word each time, unfortunately. It never gets to the else statement even using this.

I'm calling it within a switch statement- where as long as words are coming in, this is implemented.

switch (num)
{
case WORD: printf("WORD worked\n"); //instead of case 1, just...

Hi,
I'm taking words from an unknown amount of documents and adding them to a tree. I have a problem in my insert function, though, and it keeps reseting root everytime a new word needs to be added...

^look up, Hammer called me on that already, That was my problem.

Good idea! Thanks again :)

The last bit clears things up.
The only reason the **'s are there is to show you where I'm having issues. It's Not in the code itself.

"right" is a pointer to a struct element, whereas "temp"...

As I mentioned before, half of this is in FLEX- So it makes it harder for me to explain, but yes I guess that would make them 'super secret header files'. If you want- I can include that
part too,...

All set! Thanks!

Hi!
I'm still working on my Binary search tree. I have to add words from a file to the tree in sibling or child branches. It seems my Addaword function is wokring a little better now, but something...

Hi!
I'm building a Tree that reads words in from a text file and adds it to the tree in sibling or child branches. Everything is being scanned in ok, but something is wrong with Addaword. It seems...