基于上题代码正确的前提下,填入相应代码完善 append(),用于在双向链表尾部增加新节点,横线上应填写( )。
append()
void append(int data) { Node* newNode = new Node{data, nullptr, nullptr}; if (is_empty()) { head = tail = newNode; } else { _______________________ } ++size; }
tail->next = newNode;
newNode->prev = tail; tail = newNode;
tail = newNode; newNode->prev = tail; tail->next = newNode;
tail->next = newNode; newNode->prev = tail; tail = newNode;