类实现链表（Class linked list）.docVIP

类实现链表（Class linked list） # include iostream.h struct node { char ch; node * next; }; class linklist { public: linklist (); / / 构造 ~ linklist (); / / 析构 void create (); / / 创建 void print (); / / 显示 void del (); / / 删除 void insert (); / / 插入 void search (); / / 检索 void length (); / / 表长 private: node * head; }; linklist:: linklist () { head = new node; head - = = null; head - ch = \ n; } linklist:: ~ linklist () { node * p = head - next; / / 使指针p指向链表的第一个节点 while (p! = = null) { head - = = p - next; / / 使头指针指向p的下一个节点 delete p; p = head - next; / / 使p节点指向头指针向的那个节点 } delete head; / / 最后将头节点也删除 cout 已经删除链表! final; } void linklist:: create () / / 创建链表 { node * p, * p; char m; cout 请输入一串作为链表元素的字符, 按 # 结束: final; cin m; p = head; / / 此时p作为第一个有意义的节点 while (m! # = ) { s = new node; / / 动态的申请一个节点 s - ch = m; / / 数据域赋值 p - next = s; / / 把s 节点接在p节点之后 p = s; / / 使p向后移一个节点 cin m; / / 再次读入字符 } p - = = null; cout 链表建成! final; } void linklist:: print () / / 显示链表 { node * p; p = head - next; cout 链表为: (char) 1 ; / / 美化装饰, 输出 笑脸 while (p! = null); / / 逐个节点输出 { cout p ch ; p = p - next; } cout (char) 1 final; } void linklist:: part () / / 删除节点函数 { char m; node * p, * q; cout 输入要删除的元素:; cin m; p = head; q = p - next; while (q! = null q ch! = m) / / 循环, 使得q为要删除的节点, 而p则为q的前一个节点 { p = q; q = q - next; } if (q = = null); / / 此if 和else 位置不要颠倒, 否则容易出现错误 cout ^ t \ t m 不存在 final; else { p - next = q - next; delete q; cout ^ t \ t 节点成功删除! final; } } void linklist:: insert () / / 插入节点函数 { int i, k; char m; Node *p, *s; Cout to insert the element position:; Cini; Cout to insert elements:; Cinm; P = head; K = 1; While (k I P! = NULL) / / K value by using circulation, find P before a node to insert position { P = p-next; K++; } If (k = = I) / / insert { S = new node; S-ch = m; S-next = p-next; / / back node P insert node s P-next = s; Cout \t\t node was successfully inserted into endl! ; } Else Cout \t\t insertion position error!