二分检索算法中，如果查找不成功，结束条件是( )\n \n \n \n \n \n \n

\n \n \n \n A.\n low＞high\n

\n \n

\n \n \n \n B.\n low＞mid\n

\n \n

\n \n \n \n C.\n low ＜=high28二分检索树中，由根到所有内结点的距离之和称为{内部路径长度}\n