자료구조2 트리 #include #include #include typedef struct _tree { int key; struct _tree *left; struct _tree *right; }TREE; void insert(int, TREE**); TREE* call_malloc(int); void print(TREE*); void preorder(TREE*); void inorder(TREE*); void postorder(TREE*); void search(int, TREE*); void tree_copy(TREE*, TREE**); void mirror_copy(TREE*, TREE**); void main() { TREE *root = NULL; TREE *copy_root = NULL; TREE *mirr.. 2009. 12. 6. 이중연결리스트 #include #include #include typedef struct _dnode { int key; struct _dnode *next; struct _dnode *prev; }DNODE; DNODE *start = NULL; DNODE *cur = NULL; void insert(void); void print(void); void del_node(void); void delete_node(void); void main() { int no; while(1) { system("cls"); puts("*** MENU ***"); puts("1. INSERT"); puts("2. PRINT"); puts("3. DELETE"); puts("4. END"); printf("choice : "); sca.. 2009. 12. 6. 이전 1 다음