二叉树转换链表
摘要:
1 #include 2 #include 3 4 typedef struct node{ 5 int num; 6 struct node *left; 7 struct node *right; 8 }node; 9 10 void build_node(node **anode, int num) 11 { 12 if(*anode == NULL){ 13 (*anode) = calloc(1, sizeof(node)); 14 if((*anode) == NULL){ 15 ... 阅读全文
posted @ 2013-07-08 22:25 kevin_kang 阅读(212) 评论(0) 推荐(0)
浙公网安备 33010602011771号