尼古拉斯豆

摘要： 最小数在根节点,一层比一层大的二叉树.#include <stdio.h>typedef int elemType;struct heap{ elemType *heap; int len; int maxsize;};/* 1.c初始化堆*/void initHeap(struct heap *hbt, int ms){ if(ms < 0) { printf("数组长度参数非法.\n"); system("pause"); } hbt->heap = malloc(sizeof(elemType)); ... 阅读全文