摘要：
The whole process for .c --> executable file. .c -> .s in assembly language, and then --> .o in the efl format , but when we try to call different .c 阅读全文
摘要：
000 - search tree 002 -- count the nodes in the tree 003 -- compare 2 binary trees 004 - degree check of the tree 005- find a element in the binary se 阅读全文
摘要：
1- definition A variable that contains a memory address, points to somewhere in the process’ virtual address space 2- dereference a pointer 3- pointer 阅读全文
摘要：
000-- Define a Stack #define STACK_INIT_SIZE 100 initStack(sqStack *s){ s->base = (ElemType *)malloc(STACK_INIT_SIZE*sizeof(ElemType)) if(!s) { exit(0 阅读全文
摘要：
000-- define a Dulinklist A empty DuLinklist: Add a new Node Delete a Node print A-Z with the defined sequence by user e.g. user input 3 then should b 阅读全文
摘要：
000--Magic Poker Put the poker with specific sequence, so that they can show as below: count 1, open the first card as A, count 2, the first one place 阅读全文
摘要：
The operation fullfilled codes: 001-- To check if a list has a circle solution1 -- pointer p,q ; p continue move forward, and q will start from head f 阅读全文
摘要：
Circle List puzzle Josephus Story: there is 41 people , 39 of them have the agreement that: all these 41 people stand as a circle, and one of them cou 阅读全文
摘要：
#include #include typedef struct CLinkList { int data; struct CLinkList *next ; } node; /*initiate a circle list*/ void ds_init(node **pNode) { int item; node *temp; no... 阅读全文
摘要：
Solution oder mit recursive : 而返回一个新的链表，只需要给指向第一个数据的指针地址就可以。 Die analysis ist sehr gut. Finden Sie die Details mit den Link. https://leetcode.com/arti 阅读全文