Because the ordered tree has ``sorted'' its values from ``left to right,'' the recursive lookup operates like the binary search algorithm on sorted arrays, ...
確定! 回上一頁