//双亲表示法：每个结点中保存指向双亲的"指针"类似于静态链表#define MAX_TREE_SIZE 100typedef struct{//结点定义ElemType data;int parent;}PTNode;typedef struct{PTNode nodes[MAX_TREE_SIZE];int n;}PTree;//删除一个结点//空数据遍历更慢，删除结点填充会更简单//孩子表示

#include "stdafx.h"#include <stdio.h>#include <iostream>using namespace std;#define Maxsize 30typedef struct {int data[Maxsize];int length;}SqList;void Mid_search(SqList &L1, SqList &a