Double free or corruption error with Stack and Binary Expression Tree
问题 I am getting the following error when trying to build a binary expression tree from a Stack. I believe the issue is where I am popping in the recursive function, I think I am popping on an empty stack but I don't know the solution. * glibc detected ./interp: double free or corruption (fasttop): 0x0934d018 ** Here is my code: //This is the main int main(int argc, char *argv[]){ TreeNode *node; StackNode *stack = NULL; push(&stack, "a"); push(&stack, "b"); push(&stack, "+"); //while (emptyStack