数据结构作业（二叉树）

1.代码：

#include<stdio.h>
#include<malloc.h>
 
typedef int elem;
 
/**
 *行、列和数据的三元组
 */
typedef struct Triple{
	int i;
	int j;
	elem e;
}Triple, *TriplePtr;
 
/**
 *行、列和数据的三元组
 */
typedef struct CompressedMatrix{
	int rows, columns, numElements;
	Triple* elements;
}CompressedMatrix, *CompressedMatrixPtr;
 
/**
 *初始化压缩矩阵
 */
CompressedMatrixPtr initCompressedMatrix(int paraRows, int paraColumns, int paraElements, int** paraData){
	int i;
	CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
	resultPtr->rows = paraRows;
	resultPtr->columns = paraColumns;
	resultPtr->numElements = paraElements;
	resultPtr->elements = (TriplePtr)malloc(paraElements * sizeof(struct Triple));
	
	for(i = 0;i < paraElements; i++){
		resultPtr->elements[i].i = paraData[i][0];
		resultPtr->elements[i].j = paraData[i][1];
		resultPtr->elements[i].e = paraData[i][2];	
	}
	
	return resultPtr;
}
 
/**
 * 打印压缩矩阵
 */
void printCompressedMatrix(CompressedMatrixPtr paraPtr){
	int i;
	for(i = 0; i < paraPtr->numElements; i++){
		printf("(%d, %d): %d\r\n",paraPtr->elements[i].i,paraPtr->elements[i].j,paraPtr->elements[i].e);
	}
}
 
/**
 *转置压缩矩阵
 */
CompressedMatrixPtr transposeCompressedMatrix(CompressedMatrixPtr paraPtr){
	//Step 1.分配空间
	int i,tempColumn,tempPosition;
	int *tempColunmnCounts = (int*)malloc(paraPtr->columns * sizeof(int));
	int *tempOffsets = (int*)malloc(paraPtr->columns * sizeof(int));
	for(i = 0; i < paraPtr->columns;i++){
		tempColunmnCounts[i]=0;
	}
	
	CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
	resultPtr->rows = paraPtr->columns;
	resultPtr->columns = paraPtr->rows;
	resultPtr->numElements =paraPtr->numElements;
	
	resultPtr->elements = (TriplePtr)malloc(paraPtr->numElements * sizeof(struct Triple));
	
	//Step 2.一次扫描以计算偏移
	for(i = 0; i < paraPtr->numElements; i++){
		tempColunmnCounts[paraPtr->elements[i].j]++;
	}
	for(i = 0; i < paraPtr->columns; i ++){
		tempOffsets[i] = tempOffsets[i - 1]+ tempColunmnCounts[i - 1];
		printf("tempOffsets[%d] = %d \r\n", i, tempOffsets[i]);
	}
	
	
	//Step 3.另一次扫描以填充数据
	for(i = 0; i < paraPtr->numElements; i ++){
		tempColumn = paraPtr->elements[i].j;
		tempPosition = tempOffsets[tempColumn];
		resultPtr->elements[tempPosition].i = paraPtr->elements[i].j;
		resultPtr->elements[tempPosition].j = paraPtr->elements[i].i;
		resultPtr->elements[tempPosition].e = paraPtr->elements[i].e;
		
		tempOffsets[tempColumn]++;
	}
	
	return resultPtr;
}
 
/**
 *测试压缩矩阵
 */
void compressedMatrixTest(){
	CompressedMatrixPtr tempPtr1, tempPtr2;
	int i , j, tempElements;
	
	//构建第一个样本矩阵
	tempElements = 4;
	int** tempMatrix1 = (int**)malloc(tempElements * sizeof(int*));
	for(i = 0; i < tempElements; i ++){
		tempMatrix1[i] = (int*)malloc(3 * sizeof(int));
	}
	
	int tempMatrix2[4][3] = {{0, 0, 2}, {0, 2, 3},{2, 0, 5},{2, 1, 6}};
	for(i = 0; i < tempElements; i ++){
	      for(j = 0; j < 3;j ++){
	tempMatrix1[i][j] = tempMatrix2[i][j];
    }
}
 
 
   tempPtr1 = initCompressedMatrix(2, 3, 4, tempMatrix1);
   
   printf("After initialization.\r\n");
   printCompressedMatrix(tempPtr1);
 
   tempPtr2 = transposeCompressedMatrix(tempPtr1);
   printf("After transpose.\r\n");
   printCompressedMatrix(tempPtr2);
}
   
int main(){
	compressedMatrixTest();
	
	return 1;
}

2.运行结果：