In order to improve the search efficiency,there is only one element in a bucket as much as possible. In the following insertion code, the second-level pointer method is used, but it is not very complicated. When inserting, the predecessor node will be found, and the operation is Thenext_...