103 lines
2.2 KiB
C
103 lines
2.2 KiB
C
|
////
|
|||
|
|
//// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
////
|
|||
|
|
//
|
|||
|
|
//#define _CRT_SECURE_NO_WARNINGS
|
|||
|
|
//#include <string.h>
|
|||
|
|
//#include <stdlib.h>
|
|||
|
|
//#include "Dict.h"
|
|||
|
|
//
|
|||
|
|
//
|
|||
|
|
//// <20><><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
//struct NodeTree {
|
|||
|
|
// char* word;
|
|||
|
|
// struct NodeTree* left;
|
|||
|
|
// struct NodeTree* right;
|
|||
|
|
//};
|
|||
|
|
//
|
|||
|
|
//// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
//struct NodeTree* root = NULL;
|
|||
|
|
//
|
|||
|
|
//
|
|||
|
|
//
|
|||
|
|
//struct NodeTree* addElement(struct NodeTree* p, char* word)
|
|||
|
|
//{
|
|||
|
|
// int cond;
|
|||
|
|
//
|
|||
|
|
// if (p == NULL) {
|
|||
|
|
// p = (struct NodeTree*)malloc(sizeof(struct NodeTree));
|
|||
|
|
// p->word = (char*)calloc(strlen(word) + 1, sizeof(char));
|
|||
|
|
// strcpy(p->word, word);
|
|||
|
|
// p->left = p->right = NULL;
|
|||
|
|
// }
|
|||
|
|
// else if ((cond = strcmp(word, p->word)) == 0) {
|
|||
|
|
// // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
// // <20> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> - <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
// }
|
|||
|
|
// else if (cond < 0) {
|
|||
|
|
// // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
// // <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
// p->left = addElement(p->left, word);
|
|||
|
|
// }
|
|||
|
|
// else {
|
|||
|
|
// // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
// // <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
// p->right = addElement(p->right, word);
|
|||
|
|
// }
|
|||
|
|
// return p;
|
|||
|
|
//}
|
|||
|
|
//
|
|||
|
|
//
|
|||
|
|
//
|
|||
|
|
//void clearTree(struct NodeTree* p) {
|
|||
|
|
// if (p != NULL) {
|
|||
|
|
// clearTree(p->left);
|
|||
|
|
// clearTree(p->right);
|
|||
|
|
// free(p->word);
|
|||
|
|
// free(p);
|
|||
|
|
// }
|
|||
|
|
//}
|
|||
|
|
//
|
|||
|
|
//int containElement(struct NodeTree* p, char* word) {
|
|||
|
|
// int cond;
|
|||
|
|
// if (p == NULL) {
|
|||
|
|
// return 0;
|
|||
|
|
// }
|
|||
|
|
// else if ((cond = strcmp(word, p->word)) == 0) {
|
|||
|
|
// return 1;
|
|||
|
|
// }
|
|||
|
|
// else if (cond < 0) {
|
|||
|
|
// return containElement(p->left, word);
|
|||
|
|
// }
|
|||
|
|
// else {
|
|||
|
|
// return containElement(p->right, word);
|
|||
|
|
// }
|
|||
|
|
//}
|
|||
|
|
//
|
|||
|
|
//
|
|||
|
|
//
|
|||
|
|
///* INSERT <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>.
|
|||
|
|
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>.
|
|||
|
|
//<2F><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>.*/
|
|||
|
|
//void Insert(char* word) {
|
|||
|
|
// root = addElement(root, word);
|
|||
|
|
//}
|
|||
|
|
//
|
|||
|
|
///* MEMBER <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD>.*/
|
|||
|
|
//int Member(char* word) {
|
|||
|
|
// return containElement(root, word);
|
|||
|
|
//}
|
|||
|
|
//
|
|||
|
|
///* CREATE - <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>.
|
|||
|
|
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>. */
|
|||
|
|
//void Create() {
|
|||
|
|
// root = NULL;
|
|||
|
|
//}
|
|||
|
|
//
|
|||
|
|
///* DESTROY - <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>.
|
|||
|
|
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>. */
|
|||
|
|
//void Destroy() {
|
|||
|
|
// clearTree(root);
|
|||
|
|
// root = NULL;
|
|||
|
|
//}
|