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）查找算法。