粗略的写了一下大根堆的建立以及输出排序数据的过程，然后用图示来表示结果
程序如下：
#include<iostream>using namespace std;//节点声明，数据域、左孩子指针、右孩子指针typedef struct BiTNode{int data;int t;//这个是用来表示这是第几个结点struct BiTNode *lchild, *rchild;}BiTNode, *BiTree;int ch[100];//这个是用来存储每个结点的值。int m = 1;//用来表示一共有多少个数据。BiTNode *Q[100];//存储所有结点的地址值BiTree createBiTree(){BiTNode *root = new BiTNode;BiTNode *q;int rear =1;int front = 1;printf("输入数据（以-123结束)");scanf("%d", &ch[m]);while (1){if (ch[m] == -123)break;if (ch[m] == 0){q = NULL;m–;}else{q = new BiTNode;q->data = ch[m];q->t = m;q->lchild = q->rchild = NULL;}Q[rear++] = q;if (m == 1)root =q; m++;printf("输入数据（以-123结束)");scanf("%d", &ch[m]);}while (rear != front){q = Q[front];if (q){if (2 * front < m){q->lchild = Q[2 * front];}if (2 * front + 1 <m){q->rchild = Q[2 * front + 1];}}front++;}m–;return root;}void printTree(BiTree &T, int depth){int i;if (T->rchild)printTree(T->rchild, depth + 1);for (i = 1; i <= depth; i++)printf(" ");printf("%d,%d\n", T->data,T->t);if (T->lchild)printTree(T->lchild, depth + 1);}void Createbigstack(BiTree &T){int i;for (i = m / 2; i >= 1; i–){if (Q[i]){if (Q[i]->lchild){if ((Q[i]->lchild->data) > (Q[i]->data)){int temp = Q[i]->data;Q[i]->data = Q[i]->lchild->data;Q[i]->lchild->data = temp;}}if (Q[i]->rchild){if ((Q[i]->rchild->data) > (Q[i]->data)){int temp = Q[i]->data;Q[i]->data = Q[i]->rchild->data;Q[i]->rchild->data = temp;}}}}//下面注释的这一部分是从上向下再进行检查一次看是不是符合构成大根堆的条件。但是如果不用这一步的话，同样可以排序，，而且会节省很多时间。有木有 //大神告诉我到底用不用呢？/*for (i = 1; i <= m / 2; i++){if (Q[i]){if (Q[i]->lchild){if ((Q[i]->lchild->data) > (Q[i]->data)){int temp = Q[i]->data;Q[i]->data = Q[i]->lchild->data;Q[i]->lchild->data = temp;}}if (Q[i]->rchild){if ((Q[i]->rchild->data) > (Q[i]->data)){int temp = Q[i]->data;Q[i]->data = Q[i]->rchild->data;Q[i]->rchild->data = temp;}}}}*/}void diedaibigstack(BiTree &T){//int s = 0;while (m){{Createbigstack(T);//s++;//printf("调整%d次后的大根堆是:\n",s);//printTree(T, 0);}printf("%d ", T->data);Q[1]->data = Q[m]->data;if (m % 2 == 0){Q[m / 2]->lchild = NULL;}else{Q[m / 2]->rchild = NULL;}m–;}}int main(void){BiTNode *T;printf("请利用层次法建立的二叉树!\n");T=createBiTree();int depth = 0;printTree(T, 0);//Createbigstack(T);//printf("调整一次后的大根堆是:\n");//printTree(T, 0);diedaibigstack(T);return 0;}
仿佛松树就是一位威风的将军，守护着国家的国民。
