PSY_IT_Tech

[ 자료구조 ] Tree Linked List로 구현하기 (2) #include #include struct tnode { int data; struct tnode* left_child; struct tnode* right_child; }; typedef struct tnode node; typedef node* tree_ptr; int main(){ int i; tree_ptr head = NULL, temp = NULL; temp = (tree_ptr)malloc(sizeof(node)); temp->data = 0; temp->left_child = NULL; temp->right_child = NULL; head = temp; tree_ptr head = NULL, temp = NULL; temp..

[ 자료구조 ] Tree Linked List로 구현하기 (1) #include #include struct tnode{ int data; struct tnode * left_child; struct tnode * right_child; }; typedef struct tnode node; typedef node * tree_ptr; tree_ptr insert(tree_ptr head, int * number){ tree_ptr tnodes[5]; tree_ptr temp = NULL; for(int i = 0; idata = number[i]; tnodes[i]->left_child = tnodes[i]->right_child = NULL; } head = tnodes[0]; tnodes[0]->le..