Owl Life

Double Linked List 소스코드입니다. #include "iostream" using namespace std; #define MAX_NODE 1000 #define INIT_DATA -1 typedef int T; typedef struct _node { T data; struct _node *prev, *next; } NODE; NODE node_list[MAX_NODE + 1]; int node_idx; NODE *head; int node_count; NODE *alloc_node() { NODE *new_node = &node_list[node_idx++]; new_node->prev = new_node->next = 0; return new_node; } void init() { n..