[2 - 2 주차]트리, 힙 구현과 탐색

struct linkedlist{
	int data;
	struct linkedlist *next;
	struct linkedlist *prev;
};
typedef	struct linkedlist LINKEDLIST;
typedef LINKEDLIST *LINK;

void heapTree( LINK *node, int data ){
	if( *node == NULL ){
		*node = newList(data);
	}else{
		if( (*node)->data > data ){
			heapTree( &(*node)->prev , data );
		}else{
			heapTree( &(*node)->next , data );
		}
	}
}

void preorder( LINK node ){
	if(node->data != NULL)
		printf("%d",node->data);
	if(node->prev != NULL)	
		preorder(node->prev);
	if(node->next != NULL)
		preorder(node->next);
}

void postorder( LINK node ){
	if(node->prev != NULL)	
		preorder(node->prev);
	if(node->next != NULL)	
		preorder(node->next);
	if(node->data != NULL)
		printf("%d",node->data);
}

void inorder( LINK node ){
	if(node->prev != NULL)
		preorder(node->prev);
	if(node->data != NULL)
		printf("%d",node->data);
	if(node->next != NULL)
		preorder(node->next);
}
void main(void){
	LINK root = NULL;//= (LINK)malloc(sizeof(LINKEDLIST));	
	heapTree(&root,11);
	heapTree(&root,10);
	heapTree(&root,12);

	printf("  PREORDER : ");
	preorder(root);
	printf("  POSTORDER : ");
	postorder(root);
	printf("  INORDER : ");
	inorder(root);
}