以前写的 最近找出来 加上了逆置的功能
#include<iostream>
#include<string>
#define N 10
using namespace std;
struct ptnode
{
char name[20];
ptnode *llink,*rlink;
};
ptnode *create(int n);
ptnode *search(ptnode *head,char *p);
void insert(ptnode *head,char *p,char *inp);
void print(ptnode *head);
void Delete(ptnode *ptr);
void Contray_Dul(ptnode *head);//逆置
int main()
{
int n;
char stuname[20];
char insertname[20];
ptnode *head,*searchpoint;
cout<<"输入链表长度:";
cin>>n;
head=create(n);
print(head);
cout<<"输入你要查找的名字:";
cin>>stuname;
searchpoint=search(head,stuname);
cout<<"你想要查找的名字是:"<<searchpoint->name<<endl;
Delete(searchpoint);
print(head);
cout<<"你想在哪个名字前插入:";
cin>>stuname;
cout<<"输入你想插入的名字:";
cin>>insertname;
insert(head,s