定義 struct Node { int val; struct Node *x; };插入:Node *insert(Node *head,int x) {Node *pre = NULL, *h = head; while ((head != NULL) && (head->val < x)) {pre = head; head = head->next; } Node *temp = new Node; temp->val = x; temp->next = head; if (pre == NULL) { return temp; } pre->next = temp; return h;}刪除一個xNode *del(Node *head,int x) {Node *pre = NULL, *h = head; while ((head != NULL) && (head->val < x)) { pre = head; head = head->next; } if ((head != NULL) && (head->val == x)) { if (pre == NULL) { h = h->next; } else { pre = pre->next; } delete head; } return h;}