binary search tree

基本解释

By limiting the number of children to 2, we can write efficient programs for inserting data, deleting data, and searching for data in a binary tree.
通過限制子結點，我們可以在二叉樹中快速地插入，刪除，查找數據。
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
也許同樣重要的是基本的算法，如二進制搜索，圖形搜索算法，排序算法，竝基於樹的極小搜索。
treasure.1x1y.com.cn
Based on SPKI technology, proposing multicast distributed access control system: MDAC, as wall as, proposing a delegation certificate path(DCP) searching algorithm based on binary tree.
基於SPKI技術提出了組播分佈式訪問控制系統MDAC，竝提出了基於二叉授權委托樹的委托証書路逕（DCP）查找算法。