#include "stdafx.h"
struct tree{
int left;
int data;
int right;
};
typedef struct tree treenode;
const int num = 32768;
treenode tree[num];
int _tmain(int argc, _TCHAR* argv[])
{
int n = 9;
int x = 1;
int i;
int num[10] = {6,3,8,5,2,9,4,7,10};
tree[1].data = num[0];
tree[1].left = -1;
tree[1].right = -1;
for ( i= 2; i < 10; i++){
tree[i].left = -1;
tree[i].right = -1;
tree[i].data = 0;
}
for (i = 1; i < 9; i++){
x = 1;
while (tree[x].data != 0){
if (num[i] < tree[x].data){
if (tree[x].left == -1){
tree[x].left = i + 1;
x = i + 1;
tree[x].data = num[i];
break;
}
else {
x = tree[x].left;
}
}
else {
if (tree[x].right == -1){
tree[x].right = i + 1;
x = i + 1;
tree[x].data = num[i];
break;
}
else {
x = tree[x].right;
}
}
}
}
for (int i = 1; i < 10; i++){
printf("%d %d %d\n", tree[i].left, tree[i].data, tree[i].right);
}
return 0;
}
C语言二叉树结构数组法
最新推荐文章于 2022-10-15 14:25:13 发布