红黑树是一种自平衡二叉查找树，是在计算机科学中用到的一种数据结构，典型的用途是实现关联数组。-AVL trees are actually easier to implement than RB trees because there are fewer cases. And AVL trees require O(1) rotations on an insertion, whereas red-black trees require O(lg n). In practice, the

先实现了将前缀表达式转换为逆波兰表达式的功能, 之后再利用逆波兰表达式对表达式进行求值, 支持+,-,*,/,^等运算, 以及sqrt, lg, ln, exp, sin, cos, tan, asin, acos, atan, sh, ch等函数操作-First realized the prefix expressions into reverse Polish notation features, re-use reverse Polish expression after the exp