Introduction - If you have any usage issues, please Google them yourself
Title: on the record sequence: (), respectively 55,13,23,72,109,67,2,78,13 order to find and use half the search algorithm to achieve a specific keyword to find the value of the record. Then the establishment of the record sequence of binary sort tree, and in its values to achieve a specific keyword node to find and delete.