说明：  实现了二叉树的链表储存，前中后序层次遍历，可求树高及节点数，可增删节点
(The chain table of two forked trees is stored, and the front and post sequence is traversed. The height of the tree and the number of nodes can be found, and the nodes can be added and deleted)