二叉树建立、遍历、判断一个二叉搜索树是否为完全二叉树
为了找工作练的,求人品
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn = 100000;
struct node{
int data, lef, rig, state, hei;
}tree[maxn];
void creat(int p, int ans, int v){ //建树
if( v <= tree[p].data){
if( tree[p].lef == NULL){
tree[p].lef = ans;
tree[ans].data = v;
tree[ans].lef = tree[ans].rig = NULL;
return;
}
creat(tree[p].lef, ans, v);
}
else {
if( tree[p].rig == NULL){
tree[p].rig = ans;
tree[ans].data = v;
tree[ans].lef = tree[ans].rig = NULL;
}
creat(tree[p].rig, ans, v);
}
}
int find(int p, int hei){ // 是否为完全二叉树
int h1, h2, s1, s2, mm = 1;
if( tree[p].lef == NULL && tree[p].rig == NULL){
tree[p].state = 1;
tree[p].hei = 1;
return 1;
}
if( tree[p].lef != NULL){
mm = max(mm, find(tree[p].lef, hei+1) + 1);
h1 = tree[tree[p].lef].hei;
s1 = tree[tree[p].lef].state;
}
else{
h1 = 0;
s1 = 1;
}
if( tree[p].rig != NULL){
mm = max(mm, find(tree[p].rig, hei+1)+1);
h2 = tree[tree[p].rig].hei;
s2 = tree[tree[p].rig].state;
}
else {
// mm = max( mm, 1);
h2 = 0;
s2 = 1;
}
tree[p].hei = mm;
if( h1 == h2){
if( s1 == 1 && s2 == 1) tree[p].state = 1;
else if( s1 == 1 && s2 == 2) tree[p].state = 2;
else tree[p].state = 0;
}
else if( h1 - h2 == 1){
if( s1 == 1&& s2 == 1) tree[p].state = 2;
else if( s1 == 2 && s2 == 1) tree[p].state = 2;
else tree[p].state = 0;
}
else tree[p].state = 0;
return mm;
}
int dfs(int p, int hei){ //求树的深度
int mm = hei;
if( tree[p].lef != NULL){
mm = max(dfs(tree[p].lef, hei+1), mm);
}
if( tree[p].rig != NULL){
mm = max( dfs(tree[p].rig, hei+1), mm);
}
return mm;
}
int main(){
//freopen("1.txt", "r", stdin);
int i, aa, ans, mm;
for( i= 0; i<maxn; i++)
tree[i].lef = tree[i].rig = NULL;
scanf("%d", &aa);
tree[0].data = aa;
tree[0].lef = tree[0].rig = NULL;
ans = 1;
while( scanf("%d", &aa) && aa!= 0){
creat(0, ans, aa);
ans ++;
}
mm = dfs(0, 1);
cout<<"the height of the tree is "<<mm<<endl;
mm = find(0 , 1);
if( tree[0].state != 0) cout<<"true\n"<<endl;
else cout<<"false"<<endl;
return 0;
}