void traverseBackward(Node root) //fwd를 bwd로 바꾸면댐

{

Node *q = root.bwd;

while (q)

{

printf("%d ", q->value);

q = q->bwd;

}

}


int insertLast(Node *root, int val)

{

Node *node = (Node *)malloc(sizeof(Node));

if (node == NULL) return 0;

node->value = val;

/* For a previously empty list */

if (root->fwd == NULL)

{

root->fwd = node;

root->bwd = node;

node->fwd = NULL;

node->bwd = NULL;

}

/* For a list with at least one node */

else                                                 //이쪽부분 바뀐거야

{

root->fwd->fwd = node; 

node->bwd = root->fwd;


root->bwd = node;

node->fwd = NULL;

}

return 1;

}