搜索链表最后一个结点并打印其数值 template <class Type> void Print( ListNode<Type>*)i if(f->ink=- NULL cout <<f->data < endl else Print(f->link ) 递归找链尾 Lao+a+a3+an搜索链表最后一个结点并打印其数值 template <class Type> void Print ( ListNode<Type> *f ) { if ( f ->link == NULL ) cout << f ->data << endl; else Print ( f ->link ); } f f f f f a0 a1 a2 a3 a4  递归找链尾