int main(int argc, char** argv) {
recyclr = newLL();
inQ = newLL();
timeQ = newLL();
ArgRead ar = {'\n', stdin};
ArgTime at = {CLOCK_MONOTONIC};
ArgPrint ap = {'\n', stdout};
// Run the program
Thread
*tr = newThread(NULL, thr_read, &ar),
*tt = newThread(NULL, thr_time, &at);
thr_print(&ap);
// We exit soon, still run deletion,
// to clean up possible FDs and do some
// error checking
deleteThread(tr);
deleteThread(tt);
deleteLL(recyclr);
deleteLL(inQ);
deleteLL(timeQ);
return 0;
}
TEST(flattenBT2LL_Test, Positive01){
Solution s;
TreeNode *root = constructBT();
TreeNode *expected = constructFlattenLL();
s.flatten(root);
EXPECT_TRUE(assertLL(expected, root));
deleteLL(expected);
deleteLL(root);
}
int main()
{
struct Node *LL1 = NULL, *LL2 = NULL;
int i;
for(i=0;i<10;i++)
{
if((i+1)<6)
insert(&LL1, (i+1));
else
insert(&LL2, (i+1));
}
insert(&LL2,12);
insert(&LL1,13);
insert(&LL2,14);
printf("The sorted linked lists are: \n");
printf("LL1: "); display(LL1);
printf("LL2: "); display(LL2);
mergeLL(&LL1, &LL2);
printf("The merged list: ");
display(LL1);
deleteLL(LL1);
}
//delete the nodes of the linked list
void deleteLL(struct Node *n)
{
if(n==NULL)
return;
deleteLL(n->next);
free(n);
}
int main(){
int i=0;
struct LinkedList* L = (struct LinkedList *)malloc(sizeof(struct LinkedList));
for(i=0; i< 28; i++)
{
if(i%5 ==1)
addLL(i,L);
}
printLL(L);
printf("Test delete head\n");
L= deleteLL(0, L);
printLL(L);
printf("Test delete middle\n");
L = deleteLL(16, L);
printLL(L);
return 0;
}
int main (int argc, char *argv){
int values[] = {1,2,3,4,5,6,7,8,9,10};
lnode *head = (lnode *) malloc(sizeof(lnode));
makeLL(&head,values);
printLL(&head);
insertLL(&head,23,4);
printf("after inserting \n");
printLL(&head);
deleteLL(&head,4);
printf("after deleting \n");
printLL(&head);
return 0;
}
