1. 采用key-value模型判断一个单词是否拼写正确,并且显示翻译。

BSVTree.h

#pragma once

#include <stdio.h>
#include <malloc.h>
#include <assert.h>
#include <string.h>
#include <stdlib.h>

typedef char* BSTKeyType;
typedef char* BSTValueType;

typedef struct BSTreeNode
{
	struct BSTreeNode* _left;
	struct BSTreeNode* _right;
	BSTKeyType _key;
	BSTValueType _value;
}BSTreeNode;

int BSTreeInsert(BSTreeNode** ppTree, BSTKeyType key, BSTValueType value);
int BSTreeRemove(BSTreeNode** ppTree, BSTKeyType key);
BSTreeNode* BSTreeFind(BSTreeNode** ppTree, BSTKeyType key);
void BSTreeInOrder(BSTreeNode** ppTree);
void TestBSTree1();

BSVTree.c

#define  _CRT_SECURE_NO_WARNINGS 0


#include "BSVTree.h"


// key/value


BSTreeNode* BuyBSTreeNode(BSTKeyType key, BSTValueType value)
{
	BSTreeNode* node = (BSTreeNode*)malloc(sizeof(BSTreeNode));
	node->_left = NULL;
	node->_right = NULL;
	node->_key = (BSTKeyType)malloc(strlen(key) + 1);
	strcpy(node->_key, key);
	node->_value = value;

	return node;
}

int BSTreeInsert(BSTreeNode** ppTree, BSTKeyType key, BSTValueType value)
{
	BSTreeNode* cur = *ppTree;
	BSTreeNode* parent = NULL;
	if (*ppTree == NULL)
	{
		*ppTree = BuyBSTreeNode(key, value);
		return 1;
	}
	while (cur)
	{
		if (strcmp(cur->_key, key) > 0)
		{
			parent = cur;
			cur = cur->_left;
		}
		else if (strcmp(cur->_key, key) < 0)
		{
			parent = cur;
			cur = cur->_right;
		}
		else
		{
			return 0;
		}
	}
	if (strcmp(parent->_key, key) < 0)
	{
		parent->_right = BuyBSTreeNode(key, value);
	}
	else
	{
		parent->_left = BuyBSTreeNode(key, value);
	}

	return 1;
}

BSTreeNode* BSTreeFind(BSTreeNode** ppTree, BSTKeyType key)
{
	BSTreeNode* cur = *ppTree;
	while (cur)
	{
		if (strcmp(cur->_key, key) < 0)
		{
			cur = cur->_right;
		}
		else if (strcmp(cur->_key, key) > 0)
		{
			cur = cur->_left;
		}
		else
		{
			return cur;
		}
	}

	return NULL;
}

void BSTreeInOrder(BSTreeNode** ppTree)
{
	BSTreeNode* root = *ppTree;
	if (*ppTree == NULL)
	{
		return;
	}

	BSTreeInOrder(&root->_left);
	printf("%s:%d\n", root->_key, root->_value);
	BSTreeInOrder(&root->_right);
}

void TestBSTree1()
{
	char str[10];
	BSTreeNode* pTree = NULL;
	BSTreeInsert(&pTree, "insert", "插入");
	BSTreeInsert(&pTree, "sort", "分类");
	BSTreeInsert(&pTree, "find", "找");
	BSTreeInsert(&pTree, "tree", "树");
	BSTreeInsert(&pTree, "destory", "销毁");
	while (1)
	{
		scanf("%s", str);
		if (BSTreeFind(&pTree, str))
		{
			printf("正确的单词\n");
			printf("%s\n", BSTreeFind(&pTree, str)->_value);
		}
		else
		{
			printf("错误的单词\n");
		}
	}
}


int main()
{
	TestBSTree1();
	system("pause");
	return 0;
}

2. 采用key-value模型求出输入单词重复出现的次数？

BSVTree.h

#pragma once

#include <stdio.h>
#include <malloc.h>
#include <assert.h>
#include <string.h>
#include <stdlib.h>

typedef char* BSTKeyType;
typedef char* BSTValueType;

typedef struct BSTreeNode
{
	struct BSTreeNode* _left;
	struct BSTreeNode* _right;
	BSTKeyType _key;
	BSTValueType _value;
}BSTreeNode;

int BSTreeInsert(BSTreeNode** ppTree, BSTKeyType key, BSTValueType value);
int BSTreeRemove(BSTreeNode** ppTree, BSTKeyType key);
BSTreeNode* BSTreeFind(BSTreeNode** ppTree, BSTKeyType key);
void BSTreeInOrder(BSTreeNode** ppTree);
void TestBSTree1();

BSVTree.c

#define  _CRT_SECURE_NO_WARNINGS 0


#include "BSVTree.h"


// key/value


BSTreeNode* BuyBSTreeNode(BSTKeyType key, BSTValueType value)
{
	BSTreeNode* node = (BSTreeNode*)malloc(sizeof(BSTreeNode));
	node->_left = NULL;
	node->_right = NULL;
	node->_key = (BSTKeyType)malloc(strlen(key) + 1);
	strcpy(node->_key, key);
	node->_value = value;

	return node;
}

int BSTreeInsert(BSTreeNode** ppTree, BSTKeyType key, BSTValueType value)
{
	BSTreeNode* cur = *ppTree;
	BSTreeNode* parent = NULL;
	if (*ppTree == NULL)
	{
		*ppTree = BuyBSTreeNode(key, value);
		return 1;
	}
	while (cur)
	{
		if (strcmp(cur->_key, key) > 0)
		{
			parent = cur;
			cur = cur->_left;
		}
		else if (strcmp(cur->_key, key) < 0)
		{
			parent = cur;
			cur = cur->_right;
		}
		else
		{
			return 0;
		}
	}
	if (strcmp(parent->_key, key) < 0)
	{
		parent->_right = BuyBSTreeNode(key, value);
	}
	else
	{
		parent->_left = BuyBSTreeNode(key, value);
	}

	return 1;
}

BSTreeNode* BSTreeFind(BSTreeNode** ppTree, BSTKeyType key)
{
	BSTreeNode* cur = *ppTree;
	while (cur)
	{
		if (strcmp(cur->_key, key) < 0)
		{
			cur = cur->_right;
		}
		else if (strcmp(cur->_key, key) > 0)
		{
			cur = cur->_left;
		}
		else
		{
			return cur;
		}
	}

	return NULL;
}

void BSTreeInOrder(BSTreeNode** ppTree)
{
	BSTreeNode* root = *ppTree;
	if (*ppTree == NULL)
	{
		return;
	}

	BSTreeInOrder(&root->_left);
	printf("%s:%d\n", root->_key, root->_value);
	BSTreeInOrder(&root->_right);
}


void TestBSTree1()
{
	char str[10] = { '0' };
	BSTreeNode* pTree = NULL;
	while (1)
	{
		BSTreeNode* node;
		scanf("%s", str);
		if (strcmp(str, "exit") == 0)
		{
			break;
		}

		node = BSTreeFind(&pTree, str);
		if (node)
		{
			node->_value++;
		}
		else
		{
			BSTreeInsert(&pTree, str, 1);
		}
	}

	BSTreeInOrder(&pTree);
}

int main()
{
	TestBSTree1();
	system("pause");
	return 0;
}