#include <iostream>
#include <cstring>
using namespace std;
const int maxn = 100;
struct Node{
int data;
Node *lchild, *rchild, *parent;
};
Node node[maxn];
int cnt;
void init(){
memset(node, '\0', sizeof(node));
cnt = 0;
}
void create_minimal_tree(Node* &head, Node *parent, int a[], int start, int end)
{
if(start <= end){
int mid = (start + end)>>1;
node[cnt].data = a[mid];
node[cnt].parent = parent;
head = &a......
阅读全文