binary lookup

基本解釋

The vault is implemented with a simple hash lookup, and the binary file format is primitive .
窖與一個簡單的混雜查詢一起實現(xiàn)，和二進(jìn)位的文件格式是原始的。
However, the binary search lookup table is a prerequisite for the data elements must be orderly.
但是，折半查找的先決條件是查找表中的數(shù)據(jù)元素必須有序。
Because the red-black tree is a binary tree, the time complexities of lookup operations are logarithmic.
由于紅黑樹是二叉樹，查找操作的時間復(fù)雜度為對數(shù)。