ReiserFS uses a specially optimized b* balancedtree (one per filesystem) to organize all filesystem data.
ReiserFS 使用了特殊的优化 b* 平衡树（每个文件系统一个）来组织所有的文件系统数据。
2
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
3
It is a shame that the fourth tree is almost clipped off, and there is just a little too much space to the left which, because of the clipped tree, isn't balanced on the right.