So I am creating a program that takes a postfix expression and converts it to infix using a binary tree. I keep getting a double free or corruption error in my main conversi
