如何建立一个二叉树

#include <bits\stdc++.h>//万能头文件

using namespace std;

void build()

{

root=1;

tree[1].v ='A';

tree[1].left = 2;

tree[ijl.right =3;

tree[2]v ='B';

tree[2].left = 4;

tree[2].right = 5;

tree[3].v ='C';

tree[3].right = 6;

tree[4].v ='D';

tree[5].v ='E';

tree[5].left = 7;

tree[5].right = 8;

tree[6].v ='F';

tree[6]left =9;

tree[7].v ='G';

tree[8].v ='H';

tree[9].v ='I';

}