Node未完

#include <stdio.h>
typedef struct Node {
    int data;
    struct Node *pNext;
} *PNode,Node;
PNode create_list(void);
void traverse_list(PNode pHead);
bool is_empty(PNode pHead);
//增删改查
int main(int argc, const char *argv[]) {

  
}
PNode create_list(void) {

}
void traverse_list(PNode node) {

}
void sort_list(PNode pHead) {
  int i, j, t;
  PNode q, q;
  for (i = 0, p = pHead->pNext; i < len - 1; ++i,p = p->pNext) {
    for ( j = i+1, q = p->pNext; j < len; ++j, q = q->q->pNext) {
/*
         if (a[i] > a[j]) {
            t = a[i];
            a[i] = a[j];
            a[j] = t;
        }
*/
       if (p->data > q->data) {

          t = p->data;
          p->data = q->data; q->data = t;

        }
     }
return;
}