次优查找树

构造“次优查找树”，使树的带权路径近似达到最小
难点在于构造树的过程，怎样来递归寻找根节点，并且逐序形成次优查找树

#include<stdio.h>
#include<math.h>
#include<stdlib.h>

typedef struct TreeNode{
	char data;
	int weight;
	struct TreeNode *lchild,*rchild;
} TreeNode;

//初始化二叉树
void init_tree(TreeNode *root)
{
	root = NULL;
	printf("初始化成功!\n");
}

//构造次优查找树
TreeNode * SecondOptimal(TreeNode *root, char R[], int sw[], int low, int high)
{
	//由有序表R[low...high]以及累计权值表sw(其中sw[0]=0???)递归构造次优查找树T
	int i = low;
	int min = fabs(sw[high] - sw[low]);
	int dw = sw[high] + sw[low - 1];
	int j;
	for(j = low + 1; j <= high; ++j)
	{
		if(fabs( dw - sw[j] - sw[j-1]) < min)
		{
			i = j;
			min = fabs( dw - sw[j] - sw[j-1]);
		}
	}
	root = (TreeNode *)malloc(sizeof(TreeNode));
	root->data = R[i];
	if(i == low)
		root->lchi