Search:

struct t_node
{
char word[20];
int wordAppears;

struct t_node *left;
struct t_node *right;
};
typedef struct t_node TREE_NODE;

Yes, I realize this and that is why I credited him with making a valid point and said I fixed it but after fixing my "sloppiness" the problem at hand still exists. The reverseStack never goes out of...

although that is a good point and I fixed that in the reverseStack function I use isEmpty as a check so it shouldn't matter because the stack will never be used when emptied.

int isEmpty(STACK *stack)
{
return (stack->top < 0);
}

...

int pop(STACK *stack)
{
int x;