int main()
{
Node* a = createLinkList(5);
Node* b = createLinkList(5);
print_list(a);
print_list(b);
Node* c = list_add(a, b);
print_list(c);
return 0;
}
Queue* createQueue(int size){
Queue* queue = (Queue*) malloc(sizeof(Queue));
queue->linklist = createLinkList(queue->linklist);
queue->front = 0;
queue->rear = 0;
queue->max_size = size;
return queue;
}
int main()
{
Node *a = createLinkList(11);
print_list(a);
makeToCircular(&a , 6);
findBeginNode(a);
return 0;
}
int main(int argc, char **argv)
{
int a = 1;
LNode *head;
head = createLinkList(head);
head->data++;
printLink(head);
return 0;
}
int main()
{
int seq[]={1,2,3,4,5,6,7,8,9};
int size;
size=sizeof(seq)/sizeof(seq[0]);
LinkList *head;
head=createLinkList(seq,size);
printLinkList(head);
return 0;
}
int main(){
node *p=createLinkList();
margician(p);
int i;
for(i=1;i<CardNumber;i++){
printf("%d->",p->data);
p=p->next;
}
printf("%d\n",p->data);
return 0;
}
int main(int argc,char* argv[])
{
node* head = createLinkList(10);
printList(head);
deleteNode(head,head->next->next);
printList(head);
findKthToTail(head,5);
head = reverseList(head);
printList(head);
return 0;
}
struct Node* dupList(struct Node* list, int len)
{
struct Node* dup_list = createLinkList(len);
struct Node* dup_runner = dup_list;
struct Node* runner = list;
while(runner != NULL)
{
dup_runner -> val = runner -> val;
dup_runner = dup_runner -> next;
runner = runner -> next;
}
return dup_list;
}
void test_create_LinkList(){
linklist = createLinkList(linklist);
ASSERT(linklist->start->data == 0 && (countNumberOfNodes(linklist)==1));
}
