[자료구조_Day2]Double Circular Linked List

void initDCLL(Node **H) {
    *H = (Node*)malloc(sizeof(Node));
    (*H)->next = *H;
    (*H)->prev = *H;
}
 
Node * createNode( T_DATA data ){
    Node *t = (Node*)malloc(sizeof(Node));
    t->data = data;
    t->next = NULL;
    t->prev = NULL;
    return t;
}
 
void _insertNode(Node *newnode, Node *P, Node *N) {
    newnode->prev = P;
    newnode->next = N;
    P->next = newnode;
    N->prev = newnode;
}
 
typedef struct {
        char *Name;
        char *PhoneNo;
} Phonebook;
 
typedef struct _Node {   
    T_DATA data;            
    struct _Node *prev;   
    struct _Node *next;  
} Node;
 
#define insertAfterNode(newnode, T) _insertNode(newnode, T, T->next)
 
void AddPhoneBook(void)
{
Phonebook newpb;
Node *temp = NULL;

if(Head==NULL)    
     {
        temp=createNode(newpb);
         Head->next=temp;
         Head->prev=temp;
     }
    else
    {
        temp=createNode(newpb);
        insertAfterNode(temp, Head->next);
    }
}