按递增顺序找到二叉排序树中的底k个小的结点的函数,实现插入新的数据场之值，并保持二叉树的的性质不变的函数-By increasing order of binary sort tree to find the bottom in a small k-node function, insert a new data field to achieve the value and nature of the binary tree to maintain the same function