c++ 엉터리 코드 문제 지적 부탁드립니다.

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#define SIZE 500
 
using namespace std;
 
typedef class Bst* Bst_t;
class Bst {
private:
	char* data;
	int freq;
	Bst_t lchild;
	Bst_t rchild;
 
public:
	static void load_input(Bst_t *list) {
		char fname[40], line[SIZE], * token;
		const char *delim = " %.,-_'\"?!()[]:\t\n;";
		int index = 0;
		FILE* fp;
 
		cout << ("입력파일 : ");
		cin >> fname;
		fp = fopen(fname, "r");
 
		while (fgets(line, SIZE, fp) != NULL) {
			token = strtok(line, delim);
			while (token != NULL) {
				token = _strlwr(token);
				if (islower(token[0])) {
					index = token[0] - 'a';
					insert_node(&list<ol>
</ol>
 , token);
				}
				token = strtok(NULL, delim);
			}
		}
 
	}
	static void insert_node(Bst_t* A, char* data) {
		Bst_t temp = NULL, ptr = modified_search(*A, data);
 
		if (ptr || !(*A)) {
			temp = (Bst_t)malloc(sizeof(*temp));
			temp->data = (char*)malloc(sizeof(char) * (strlen(data) + 1));
			strcpy(temp->data, data);
			temp->lchild = temp->rchild = NULL;
			if (*A) {
				if (strcmp(data, ptr->data) < 0)
					ptr->lchild = temp;
				else
					ptr->rchild = temp;
			}
			else
				*A = temp;
		}
	}
	static Bst_t modified_search(Bst_t tree, char* data) {
		Bst_t ptr = NULL;
		while (tree) {
			ptr = tree;
			if (strcmp(data, tree->data) == 0) {
				//tree->freq++;
				return NULL;
			}
			if (strcmp(data, tree->data) < 0)
				tree = tree->lchild;
			else
				tree = tree->rchild;
		}
		return ptr;
	}
	static void inorder(Bst_t A) {
		if (A) {
			inorder(A->lchild);
			cout << "word : " << A->data << endl;
			inorder(A->rchild);
		}
	}
};
 
int main() {
	Bst_t list[26];
	for (int i = 0; i < 26; i++)
		list[i] = (Bst_t)malloc(sizeof(Bst));
	Bst::load_input(list);
	for (int i = 0; i < 26; i++) {
		Bst::inorder(list[i]);
		puts("");
	}
}