This paper proposes a scheme of certificate revocation management based on binary searchtrees.
提出了一种基于二叉搜索树的证书撤消管理方案。
2
Add and Remove operations are typically expensive since Binary SearchTrees require that a tree be balanced.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
3
Unlike other self-balancing binary searchtrees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.