2—3树是这样一种树：

A．每个非叶子结点都有2个或3个儿子；

B．每条众树根到树叶的路径长度相等；

C．只有一个根结点的树也是2—3树。

本题目要求从键盘输入以整数序列，建立一棵2-3树。所以我的建树构思为以2-3树的插入操作来进行建树。-2-3 tree is such a tree: A. Each non-leaf node has two or three sons　B. Each congregation tree roots to leaves is equal to the length of the path　C. 2-3 tree is only one root node of the tree. The subject of the request to establish a 2-3 tree from keyboard input to a sequence of integers. So I conceived the achievements of the achievements of 2-3 tree insertion operation.