연결 리스트

struct node{
    int val;
    node* next = nullptr;
};
bool push(node* _node, int _val){
    _node->next = new node();
    _node->next->val =_val;
    _node->next->next = nullptr;
    return true;
}
int pop_back(node* _list){
    if(_list->next != nullptr)
        pop_back(_list->next);
    else{
        return _list->val;
    }
}
void co_nodes(node* _node){
        cout << _node->val << endl;
        if(_node->next != nullptr)
            co_nodes(_node->next);
}
int main(int argc, char *argv[])
{
    node* list = new node();
    list->val = 0;
    push(list, 1);
    co_nodes(list);
    cout << "end main " << endl;
}