Can we write a program to store string expressions on the AVL Tree? If we write, how do we write?
When comparing a string, we have to assume that there is no differen