Node* listReverseOrder(Node* node) {
    assert(node);
    Node* temp3 = node;
    while (temp3->prev != NULL) {
        temp3 = temp3->prev;
    }
    Node* temp = temp3;
    Node* temp2 = temp3;
    while (temp != NULL) {
        temp = temp->next;
        temp2->next = temp2->prev;
        temp2->prev = temp;
        if (temp != NULL) {
            temp2 = temp;
        }
    }
    return temp2;
}