二叉树数据结构代码

二叉树的数组表示

#include <stdio.h>

void createbtree(int * btree,int *data,int len)
{
    int level;
    int i;
    
    btree[1] = data[1];
    for(i = 2; i <= len;i++)
    {
        level = 1;
        while(btree[level] != 0)
        {
            if(data[i] > btree[level])
                level = level * 2 + 1;
            else
                level = level * 2;
        }
        btree[level] = data[i];
    }
}

int main()
{
    int btree[16];
    
    int data[10] = {0,5,6,4,8,2,3,7,1,9};
    int i;
    
    for(i = 1;i < 16;i++)
        btree[i] = 0;
    createbtree(btree,data,9);
    for(i = 1;i < 16;i++)
        printf("%2d: [%d] \n",i,btree[i]);

    return 0;
}

二叉树的结构数组表示

#include <stdio.h>
#include <stdlib.h>

struct tree
{
    int data;
    int left;
    int right;
};
typedef struct tree treenode;
treenode btree[15];

void createbtree(int *data,int len)
{
    int level;
    int pos;
    int i;
    
    btree[0].data = data[0];
    for(i = 1;i < len;i++)
    {
        btree[i].data = data[i];
        level = 0;
        pos = 0;
        while(pos == 0)
        {
            if(data[i] > btree[level].data)
                if(btree[level].right != -1)
                    level = btree[level].right;
                else
                    pos = -1;
            else
                if(btree[level].left != -1)
                    level = btree[level].left;
                else
                    pos = 1;
        }
        if(pos == 1)
            btree[level].left = i;
        else
            btree[level].right = i;
    }
}

int main()
{
    int data[10] = {5,6,4,8,2,3,7,1,9};
    int i;
    
    for(i = 0;i < 15;i++)
    {
        btree[i].data = 0;
        btree[i].left = -1;
        btree[i].right = -1;
    }
    createbtree(data,9);
    printf("    左   数据   右 \n");
    printf("----------------------\n");
    for(i = 0;i < 15;i++)
        if(btree[i].data != 0)
            printf("%2d:[%2d]  [%2d]  [%2d]\n",i,btree[i].left,
                    btree[i].data,btree[i].right);
    return 0;
}

使用链表创建二叉树

#include <stdio.h>
#include <stdlib.h>

struct tree
{
    int data;
    struct tree* left;
    struct tree* right;
};

typedef struct tree treenode;
typedef treenode* btree;

btree insertnode(btree root,int value)
{
    btree newnode;
    btree current;
    btree back;
    
    newnode = (btree)malloc(sizeof(treenode));
    newnode->data = value;
    newnode->left = NULL;
    newnode->right = NULL;
    if(root == NULL)
    {
        return newnode;
    }
    else
    {
        current = root;
        while(current != NULL)
        {
            back = current;
            if(current->data > value)
                current = current->left;
            else
                current = current->right;
        }
        if(back->data > value)
            back->left = newnode;
        else
            back->right = newnode;
    }
    return root;
}


btree createbtree(int* data,int len)
{
    btree root = NULL;
    int i;
    
    for(i = 0;i < len;i++)
        root = insertnode(root,data[i]);
    return root;
}


void printbtree(btree root)
{
    btree ptr;
    
    ptr = root->left;
    printf("输出左子树:\n");
    while(ptr != NULL)
    {
        printf("[%2d]\n",ptr->data);
        ptr = ptr->left;
    }
    ptr = root->right;
    printf("输出右子树:\n");
    while(ptr != NULL)
    {
        printf("[%2d]\n",ptr->data);
        ptr = ptr->right;
    }
}

int main()
{
    btree root = NULL;
    
    int data[10] = {5,6,4,8,2,3,7,1,9};
    root = createbtree(data,9);
    printf("树的节点内容 \n");
    printbtree(root);
    return 0;
}