二叉树实现算术表达式存储。前序输入表达式，可进行表达式求值和表达式复合-Binary tree to achieve the arithmetic expression stored. Preorder input expression, the expression can be evaluated and the expression of complex

递归方式建立表达式树，并对表达式树进行递归和非递归两种方式的遍历，遍历方法分为先序、中序和后序，并对表达式树转为后缀表达式求值。-Established recursive expression tree, and the expression tree for recursive and non-recursive traversal of the two methods, divided into first traversal s

二叉树的遍历问题中关于使用二叉树进行表达式求值-Binary Tree Traversal issues on the use of the expression tree for evaluation

数据结构课设。关于哈夫曼树和表达式求值的-Data structure class is located. Demand on the Huffman tree and the value of the expression