摘要：
#include #include typedef int TType;typedef struct _TreeNode{ TType elem; struct _TreeNode *left, *right, *parent;}TreeNode;void Insert_BST(TreeNode *T, TType e){ TreeNode *s=(TreeNode *)malloc(sizeof(TreeNode)); s->elem=e; s->left=NULL; s->right=NULL; s->parent=NULL; TreeNode *p=T, *f; 阅读全文
摘要：
#include using namespace std;void HeapAdjust(int *A, int s, int m) //下标以1开始{ int temp_first=A[s]; for(int j=2*s;j=A[j]) break; A[s]=A[j]; s=j; } A[s]=temp_first;}void HeapSort(int *A, int len){ for(int i=len/2;i>=1;--i) { HeapAdjust(A, i, len); } ... 阅读全文