Algorithm/Data_structure
iverson_1
这个作者很懒,什么都没留下…
展开
-
线性表
// LinearList.h#ifndef _LINEARLIST_H_#define _LINEARLIST_H_#include using namespace std;template class LinearList{public: virtual bool IsEmpty() const=0; virtual int Length() const=0; virtual bool Find(int i, T& x) const=0; virtual in转载 2010-07-04 21:21:00 · 387 阅读 · 0 评论 -
RB tree VS AVL tree
AVL trees are actually easier to implement than RB trees because there are fewer cases. And AVL trees require O(1) rotations on an insertion, whereas red-black trees require O(lg n). In practice, the speed of AVL trees versus red-black trees will d转载 2010-07-22 15:54:00 · 809 阅读 · 0 评论