二叉树的实现例如：遍历，插入删除，更新，插入节点等操作(The implementation of two forked trees, such as traversing, inserting delete, updating, inserting nodes, and so on)

编写一个程序，通过前缀表达式来构造一个与之对应的算术表达式并存入二叉树中，通过中序遍历二叉树输出表达式及对其进行变量赋值，通过后序遍历二叉树计算表达式的值。(A program is written by prefix expression to construct an arithmetic expression corresponding to it and store it into two binary tree. Through traversing two fork tree out

输入一棵左儿子右兄弟表示的树，输出它(按照正常表示的)前序、后序和层次遍历的结果。 [左儿子右兄弟表示法是一种精神，务必领会] 样例说明： 2 /|\ 1 3 4 / \ \ 5 6 7(Enter a tree expressed by the right brother of a left son, and output the result of the tree, which is traversed by the preorder, the p

Descr iption 给出一棵孩子兄弟表示法下的树的结构以及各个结点的权值，要求按先序、后序、层次遍历二叉树并输出各个结点的权值。(Descr iption This paper gives the structure of a child's brother representation and the weight of each node, and asks for traversing the two fork tree according to the preorder, po