丰满树操作: 用顺序存储结构实现； 结点形式：下标，元素值； 功能：查找结点，结点的中序前驱，中序后继，中序遍历，插入结点，删除结点 -Fullness of the tree operations: storage structure in order to achieve junction forms: The next standard, element values function: to find nodes, nodes in the precursor seq