A new algorithm of symbolic expression simplification based on right-threaded binary tree

Considering that it's difficult to dealing with symbolic expressions which are stored in the form of strings, we put forward an idea that the symbolic expression is stored in a right-thread binary tree, and we minimize the right-thread binary tree so that the symbolic expression could be simplified. For a right-threaded binary tree that represents a symbolic expression, we traverse its nodes in order of its corresponding postfix expression. During the traversal, we simplify the expression. The Algorithm not only minimizes the tree, but also transforms the tree into an expression string. Experiments show that most symbolic expressions can be simplified by the method.