二叉树代码

二叉树简单事例

// An highlighted block
// shujujiegou.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//

#include <iostream>
#include <stdio.h>


typedef int KEY_VALUE;

#if 0
struct bstree_node1 {

    KEY_VALUE  date;
    struct bstree_node* left;
    struct bstree_node* right;

};

struct bstree {

    struct bstree_node* root;
};

#else



#define BSTREE_ENTRY(name , type ) \
struct name {                      \
    type* left;                    \
    type* right;                   \
}


struct bstree_node {
    KEY_VALUE data;
    BSTREE_ENTRY(, bstree_node) bst;
};

struct bstree {
    struct bstree_node* root;
    struct bstree_node* nil;
};

#endif


struct bstree_node* bstree_create_node(KEY_VALUE key) {

    struct bstree_node* node = (struct bstree_node*)malloc(sizeof(struct bstree_node));

    if (node == NULL) return NULL;   //WHY ????
    node->data = key;
    node->bst.left = node->bst.right = NULL;
    return node;

}


//insert 

int bstree_insert(struct bstree *T, KEY_VALUE key) {

    if (T == NULL) return -1;

    if (T->root == NULL) {
        T->root = bstree_create_node(key);
        return 0;
    }

    struct bstree_node* node=T->root;
    struct bstree_node* tmp=T->root;

    while (node != NULL) {
        tmp = node;
        if (key < node->data) {
            node = node->bst.left;
        }else if (key > node->data) {
            node = node->bst.right;
        }
        else {
            printf("exit !!!!\n");
            return -2;
        }
    }

    if (key < tmp->data) {

        tmp->bst.left = bstree_create_node(key);
    }
    else if (key > tmp->data)
    {
        tmp->bst.right = bstree_create_node(key);
    }

    return 0;
    
}

//traversal

int bstree_traversal(struct bstree_node* node) {

    if (node == NULL) return 0;
    bstree_traversal(node->bst.left);
    printf("%4d",node->data);
    bstree_traversal(node->bst.right);
    return 0;
}



//search

//delete
//update





#define ARRAY_LENGTH		20

int main()
{
    int keyArray[ARRAY_LENGTH] = { 24,25,13,35,23, 26,67,47,38,98, 20,13,17,49,12, 21,9,18,14,15 };

    //struct bstree T = { 0 };
    struct bstree T;
    memset(&T, 0, sizeof(T));
    int i = 0;
    for (i = 0; i < ARRAY_LENGTH; i++) {
        bstree_insert(&T, keyArray[i]);
    }

    bstree_traversal(T.root);

    printf("\n");
}