sos

奔跑的羚羊1994

#include<linearlist.h>
template <class T>class singerlist
template <class T>
class node
{private:
T element;
node<T> *link;
friend class singerlist<T>;}
template <class T>
class singerlist:public linearlist<T>
{public:
singerlist(){first=NULL;n=0;}
~singerlist();
bool IsEmpty() const;
bool find(int i,T &x) const;
..........
private:
node<T>;}
template <class T>
singerlist<T>::~singerlist()
{node<T>*p;
while(first){
p=first->link;
delete first;
p=first;}}
template <class T>
singerlist<T>::find(int i,T &x) const
{if(i<0||i>n-1)
{cout<<"out of round ";return false;}
node<>*p=first;
for(j=0;j<i;j++)
p=p->first;
x=p->element;
return true;}
想问一下大神，find函数为什么不反回x？可不可以将析构函数和find函数的指针用法讲一下？

奔跑的羚羊1994

另外,为什么isempty,find函数后面都跟const啊？

Rockyw

单步调试一下

奔跑的羚羊1994

什么意思啊?