Introduction - If you have any usage issues, please Google them yourself
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