结构体数组二叉树

#include<stdio.h>
#include<iostream>
#include<stdlib.h>
using namespace std;
class TreeNode{
	public: 
		int left;
		int right;
		float data;
	public :
		TreeNode(){
			this->left=-1;
			this->right=-1;
			this->data=-0;
		}
};

TreeNode* create(){
	int n,level,position;
	TreeNode *p;
	cout<<"请输入数目："; 
	cin>>n;
	p=new TreeNode[2*n-1];
	for(int i=1;i<=n;i++){
		level=0;
		position=0;
		cout<<"请输入数值:";
		cin>>p[i].data;
		while(position==0){
			if(p[i].data<p[level].data){
				if(p[level].left!=-1){
					level=p[level].left;
				}else{
					position=-1;
				}
			}else{
				if(p[level].right!=-1){
					level=p[level].right;
				}else{
					position=1;
				}
			}
		}
		//插入左子树 
		if(position==-1){
			p[level].left=i;
		}else{
			p[level].right=i; 
		}
	}
	return p;
}
int main(void){
	TreeNode *p;
	p=create();
	for(int i=1;i<9;i++){
		cout<<p[i].left<<" "<<p[i].data<<" "<<p[i].right<<endl;
	}
	return 0;
}