Introduction - If you have any usage issues, please Google them yourself
T refers to the pointer in the root binary sort tree to find data e, find success, returns 1 value, and return with a pointer p node address, unsuccessful, to find paths with P pointing to the last node and returns 0 value, the pointer points to f T, parent node, its value is NULL when the initial call