[자료구조_Day5]biTree,bsTree

#include<stdio.h>
 
#include"bitree.h"
 
int in_srt_array[100];
int bal_idx=0;
 
int tree_menu(void) {
 
    int i;
 
    do {
 
        printf("\n<<<Tree Menu>>>>\n");
 
        printf("1. Insert node\n");
 
        printf("2. Print_Preorder\n");
 
        printf("3. Print_Inorder\n");
        
        printf("4. Print_Postorder\n");
        
        printf("5. Print_Balance tree\n");
        
        printf("0. Quit\n");
 
        printf("Input Operation : ");
 
        scanf("%d", &i);
 
    } while(i<0 || i>10);
 
    return i;
 
}
 
BiTreeNode * insert_tree(BiTree *tree, BiTreeNode *node, int data)
{
    in_srt_array[tree->size]=data;
    
    if (bitree_is_eob(node))
    {
        node = (BiTreeNode *)malloc(sizeof(BiTreeNode));
         bitree_left(node)=NULL;
        bitree_right(node)=NULL;
           bitree_data(node) = (void *)data;
            return node;
    }
    
    else
    {    
    if(bitree_data(node)>data)
        bitree_left(node) = insert_tree(tree,bitree_left(node),data);
 
    else
        bitree_right(node) = insert_tree(tree,bitree_right(node),data);    
    }
 
     return node;
}
 
 
 
 
 
void print_preorder(BiTreeNode *node)
{
 
    if(bitree_is_eob(node))
        return;
    printf("%d ", bitree_data(node));
    print_preorder(bitree_left(node));
    print_preorder(bitree_right(node));
    
}
 
void print_inorder(BiTreeNode *node)
{
    if(bitree_is_eob(node))
        return;
        
    print_inorder(bitree_left(node));
    printf("%d ", bitree_data(node));
    print_inorder(bitree_right(node));
}
void print_postorder(BiTreeNode *node)
{
    if(bitree_is_eob(node))
        return;
 
    print_postorder(bitree_left(node));
    print_postorder(bitree_right(node));
    printf("%d ", bitree_data(node));
}
 
 
 
void bitree_init(BiTree *tree, void (*destroy)(void *data))
{
    
tree->size = 0;
 
tree->destroy = destroy;
 
tree->root =NULL;
 
return;
    
}
 
BiTreeNode * balance(BiTree *tree,int n)
{
    int ln, rn;
    BiTreeNode *r;
    
    if(n>0)
    {
        ln=(n-1)/2;
        rn=n-ln-1;
        r = (BiTreeNode *)malloc(sizeof(BiTreeNode));
        r->left = balance(&tree,ln);
        r->data=in_srt_array[(bal_idx++)];
        r->right = balance(&tree,rn);
        return r;
    }
 
    return NULL;
}
int main()
{
    int i;
    BiTree tree;
    BiTree tree2;
    bitree_init(&tree,free);
    bitree_init(&tree2,free);
    
    BiTreeNode *root = tree.root;    
    
    int data;
    
    
        while((i=tree_menu())!=0) {
        switch(i) {
 
            case 1 :
                    printf(">Input data : ");
                    scanf("%d",&data);
                    if(root = insert_tree(&tree,root,data))
                    tree.size++;
            break;
            case 2:
                printf("\nPreeorder>>");
                    print_preorder(root);
                    printf("\n");
                break;
            case 3:
                printf("\ninorder>>");
                    print_inorder(root);
                printf("\n");
                break;
            case 4:
                printf("\npostorder>>");
                    print_postorder(root);
                printf("\n");
                break;
 
            
            case 5:
 
            tree2.root=balance(&tree2,tree.size);
            print_preorder(tree2.root);
            bal_idx=0;
            
            break;
 
        }
    }
    
    system("pause");
    return 0;
}