| |||
| google到了这条: The Old Joel on Software Forum - AVL Trees vs. Red-Black Trees? 里面这段说得不错,不过具体效率很重要的话还是测一下的好,实现得很烂的RB-tree可能就会比实现得很好的AVL tree快一点。 引用:
|
| |||
| please see & check the page below Daniel K. O. - std::map and std: et based on AVL, not RB trees.it is based on the sgi style, STL compatible AVLmap. As I tested it. it does surpass sgi::RBmap. really cool. but it seems not what the books say (usually rb is better than avl -- most books say so ...). |
![]() |
| 书签 |
| 主题工具 | |
| 显示模式 | |
| |
相似的主题 | ||||
| 主题 | 主题作者 | 版面 | 回复 | 最后发表 |
| 请问sicp 2.63题 | tomato | 算法 | 3 | 2006-05-03 11:57 PM |
| [请问]Expression tree和一般的tree有什么区别阿? | Karla | 技术杂烩 | 2 | 2003-12-09 11:27 AM |
| functional的pattern match vs. OO的visitor vs. if/switch | ajoo | 技术杂烩 | 49 | 2003-09-22 04:51 PM |
| 与树实现无关的树iterator | ajoo | 技术杂烩 | 74 | 2003-06-27 01:20 PM |
| 从directory reader到tree iterator | papercrane | 技术杂烩 | 2 | 2003-04-15 03:16 PM |