binary tree 썸네일형 리스트형 binary tree 1. binary_tree.h #include #include typedef struct node{ int id; node *left; node *right; }ND; extern ND *root; int new_Node(int ); ND *insert_Node(ND *); void delete_Node(ND *); 2.binary_tree.c #include "binary_tree.h" void delete_Node(ND *p){ if(p->left != NULL) delete_Node(p->left); if(p->left != NULL) delete_Node(p->right); printf("%d\n",p->id); free(p); } ND* insert_Node(ND *p,ND *new_node){.. 더보기 이전 1 다음