regular binary fractals 规则双重分形
binary regular tree 二叉正则树
·2,447,543篇论文数据，部分数据来源于NoteExpress
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（log n） 查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
youdao
Their unconventional nature makes it hard to compare binary options with regular commodity contracts.
FORBES: Magazine Article
应用推荐
模块上移
模块下移
不移动