链表b追加到a的尾部,假设a,b都不为空 node *seekTail = a; while(seekTail->next != null) { seekTail = seekTail->next; } seekTail->next = b->next;
