当链表兑现（C++)

当链表实现（C++)

C/C++ code

class IntSLLNode {public:    int info;    class IntSLLNode *next;    IntSLLNode(int el, IntSLLNode *ptr = 0) {        info = el; next = ptr;    }};

C/C++ code

int IntSLList::deleteFromHead() {    int el = head->info;    IntSLLNode *tmp = head;    if (head == tail)              head = tail = 0;    else head = head->next;    delete tmp;    return el;}