本程序建立N(由系统定义)个节点的2叉排序树，输入要在该树中查找的数值\\n,并返回查找的次数，如果查找失败显示相应的失败信息但是仍然返回次数-procedures for the establishment of the N (defined by the system), two-node fork sort tree input to the tree in search of numerical \\ n, and return to find the number, If you fail a corresponding information but still failed to return to the number