二叉树排序查找，在根指针T所指的二叉排序树中查找数据e，查找成功时，返回1值，并用指针p返回结点地址，不成功时，用P指向查找路径中的最后一个结点并返回0值，指针f指向T的双亲结点，初始调用时其值为NU-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