Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #ifndef TREE_H
- #define TREE_H
- #include <stdio.h>
- #include <stdlib.h>
- #include <locale.h>
- #include <string.h>
- struct Tree {
- char* word;
- struct Tree *left, *right;
- };
- typedef struct Tree Node;
- void insert(Node**, char*);
- Node* search_min(Node*);
- int main() {
- Node *tree = NULL;
- insert(&tree, "wow");
- insert(&tree, "abba");
- insert(&tree, "hello");
- insert(&tree, "anna");
- insert(&tree, "bitch");
- insert(&tree, "cos");
- search_min(tree);
- system("pause");
- }
- void insert(Node **tree, char* new_word) {
- if (!(*tree)) {
- *tree = (Node*)malloc(sizeof(Node));
- (*tree)->left = (*tree)->right = NULL;
- (*tree)->word = new_word;
- return;
- }
- if (strcmp(new_word, (*tree)->word) == 0) {
- return;
- } else if (strcmp(new_word, (*tree)->word) > 0) {
- insert(&(*tree)->right, new_word);
- } else {
- insert(&(*tree)->left, new_word);
- }
- }
- Node* search_min(Node* tree){
- if (tree->left){
- search_min(tree->left);
- }
- else{
- printf("%s", tree->word);
- return tree;
- }
- }
- #endif //CTREE_TREE_H
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement