下面我們來寫一下這個(gè)函數(shù)：（程序9.6.5） void destroy(node * &head) { node *p; while (head!=NULL)//當(dāng)還有頭結(jié)點(diǎn)存在時(shí) { p=head;//頭結(jié)點(diǎn)是待刪除結(jié)點(diǎn) head=head->next;//先連 delete p;//后斷 } cout <<"The link list has been deleted!" <<endl; }
