#include <iostream>
using namespace std;
#define MAX_TREE_SIZE 100
typedef int SqBitree[MAX_TREE_SIZE];
void InitTree(SqBitree bt){
int i=0;
while(i<MAX_TREE_SIZE){ //全部赋值为0
bt[i]=0;
i++;
}
}
void CreateTree(SqBitree &bt){
int i=0;
cout<<"输入99结束...\n";
while(i<MAX_TREE_SIZE){ //二叉树赋值
cout<<"输入值bt["<<i<<"]的值:"<<endl;
cin>>bt[i];
if(bt[i]==99){bt[i]=0; break;}
i++;
}
}
int main(){
SqBitree bt;
InitTree(bt);//初始化二叉树,置0
CreateTree(bt);//二叉树赋值
cout<<bt[11];
return 0;
}
创建一棵顺序存储结构的二叉树
于 2022-11-23 17:49:17 首次发布