======================================================================link.h======================================================================#ifndef _LINK_#define _LINK_using namespace std;class Node{  //节点类 public :int val;      //保存数据 Node* next ;  //保存下一个节点的地址 Node(){       //构造函数，把指针初始化为NULL next = NULL;       }     };class Link{protected :Node* head;   //头指针 public :Link();~Link();void insertTail(int);void insertHead(int);void del(int);int indexOf(int); //查询一个元素的下标void update(int , int);void disp();                    };#endif

        ======================================================================link.cc======================================================================                                    #include "link.h"#include <iostream>using namespace std;Link::Link(){head = NULL;             }Link:: ~Link(){//释放空间，从头向尾释放 if(head != NULL){Node *p = head;head = head->next; //把头节点向后移动 delete p;          //抛弃原来的那个头节点cout << "delete one ... " << endl; }}//尾插入 void  Link::insertTail(int v){Node *p = new Node;p->val = v;   if(head == NULL){head = p;   //让新节点的指针指向新节点，即把新节点的地址保存在头指针中return ;        } Node * temp = head ; //用一个临时指针，从头节点开始找到 尾while(temp -> next != NULL){  //表示temp不是尾节点 temp = temp -> next ; //用temp后面的一个指针为自己赋值，即指向下一个节点
              } temp -> next = p;  //尾插入，最后一个节点的指针保存新节点的地址
         }//头插入 void  Link::insertHead(int v){Node *p = new Node;  //创建新节点 p->val = v ;         //保存数据 p->next =  head;     //让新节点的指针和头指针一样指向第一个节点 head = p;            //让头节点指向新节点
         }void  Link::del(int v){   //找到被删除的节点 ，if(head == NULL ){return ;        }if(head -> val == v){Node *p = head;head = head->next;delete head;}         Node *p1 = head->next; //找值相同的一个 Node *p2 = head ;      //跟在p1后面while(p1 != NULL){if(p1->val == v){p2->next = p1 -> next;delete p1;break;}           p1 = p1->next;p2 = p2->next;  } }int  Link::indexOf(int v){ //查询一个元素的下标Node * p = head ;int counter = 0 ;while( p != NULL ){if( p->val == v ){return counter ;}p=p->next ;counter++ ;}return -1 ;     } void  Link::update(int v1 , int v2){Node * p = head ;while( p != NULL ){if( p->val == v1 ){p->val = v2 ;}p = p->next ;}              }void  Link::disp(){Node *p = head;while(p != NULL){cout << p->val << " " ;        p = p->next;}      cout << endl;}

Node* Tree::_insert(int v, Node* r){  //真正实现插入操作,返回插入以后的根 if(r == NULL){         //是一棵空树 （空子树） Node* p = new Node(v); //创建新节点 r = p;                 //让新节点成为根或者子节点 return r;}if( v < r->val){  //插到左子树上 r->left = _insert(v,r->left);return r;}else{            //插到右子树上 r->right = _insert(v,r->right);      return r;}
}

    Node* & find( bnode* & root, const DATA& cd ){if( root==NULL )                    // 如果root节点是空,则为空树return root;                    // 返回root指向的地址,即NULLelse if( root->data==cd )           // 如果root节点就是要查找的数值return root;                    // 返回root指向的地址,为了清晰,和上面的分开写else if( cd < root->data )          // 如果root节点指向的值大于要查找的值return find( root->left, cd );  // 返回查找root的左子树返回的地址elsereturn find( root->right, cd ); // 否则返回查找root的右子树返回的地址}

Node* _del( int value , Node* r ){if( r == NULL ){       //删除空树return r ;}if( r->value == value ){        //删除树根if(r->left==r->right){      //左右子树都是NULL的情况下
                   delete r ;return NULL;}else if( r->right == NULL ){  //只有右子树，没有左子树的时候 Node * p = r;r = r->left ;delete p ;return r ;}else if( r->left == NULL ){   //只有右子树，没有左子树Node *p = r ;r=r->right ;delete p ;return r ;}else{                          //左右子树都有Node * p1 = r -> right ;Node * p2 = r -> right ;while( p2->left != NULL ){p2 = p2->left ;}    p2->left = r->left ;    delete r ;return p1 ;}    }if( value <= r->value ){r->left = _del( value , r->left);return r ;}else{r->right =_del( value, r->right );return r ;}    return r ;
}