binary tree search

基本解釋

A binary search tree (BST) is a binary tree with the following properties
二進(jìn)制搜索樹(shù) (BST) 是具有以下屬性的二進(jìn)制樹(shù)
It maintains the free space in heap as nodes in a Cartesian binary search tree format.
它按照 Cartesian 二分法檢索樹(shù)格式以節(jié)點(diǎn)的形式維護(hù)堆中的空閑空間。
In the above example, a simple hashmap or binary search tree could have easily solved the problem, but implementing one of these data structures in XSL would be inconvenient and unnecessary.
在上麪的示例中，如果使用一個(gè)簡(jiǎn)單的散列圖（hashmap）或二進(jìn)制搜索樹(shù)就可以輕易地解決問(wèn)題，但是用 XSL 實(shí)現(xiàn)一個(gè)這樣的數(shù)據(jù)結(jié)搆竝不是很方便，竝且是不必要的。