二叉树

最新推荐文章于 2022-05-01 12:47:37 发布

限量版的王老吉

最新推荐文章于 2022-05-01 12:47:37 发布

阅读量122

点赞数

分类专栏：数据结构和算法

本文链接：https://blog.csdn.net/u013388603/article/details/97012495

版权

数据结构和算法专栏收录该内容

8 篇文章 0 订阅

订阅专栏

直接撸代码！

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

typedef int KEY_VALUE;

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

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

struct bstree{
struct bstree_node* root;
};

struct bstree_node* bstree_create_node(KEY_VALUE key)
{
   struct bstree_node* node = (struct bstree_node*) malloc(sizeof(struct bstree_node));
   if(NULL == node)
   {
       assert(0);
   }

   node->data = key;
   node->bst.left = node->bst.right = NULL;
   return node;
}

int bstree_insert(struct bstree* T, int key)
{
assert(T != NULL);

   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(NULL != node){
       tmp = node;
       if(key < node->data){
           node = node->bst.left;
       }else{
           node = node->bst.right;
       }
   }

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

return 0;
}

int bstree_traversal(struct bstree_node* node){
   if(node == NULL)
       return 0;
   bstree_traversal(node->bst.left);
   printf("%4d\n", node->data);
   bstree_traversal(node->bst.right);
   return 0;
}

int main()
{
   int keyArray[20] = {24,25,13,35,23, 26,67,47,38,98, 20,13,17,49,12, 21,9,18,14,15};
   struct bstree T = {0};
   int i = 0;
   for(i; i < 20; i++){
       bstree_insert(&T, keyArray[i]);
   }

bstree_traversal(T.root);
return 0;
}