hash finalizado, começando binary tree

Author: mantertius

binaryTree.c

@@ -0,0 +1,54 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <math.h>
+
+typedef struct Node
+{
+    int data;
+    struct _Node* left;
+    struct _Node* right;
+}Node;
+typedef struct _binaryTree
+{
+    int height;
+    Node* root;
+}binaryTree;
+
+binaryTree* iniT()
+{
+    binaryTree* newTree = (binaryTree*) malloc(sizeof(binaryTree));
+    newTree->height = 0;
+    newTree->root = NULL;
+    return newTree;
+}
+void left(int value)
+{
+
+}
+void right(int value)
+{
+
+}
+void add(int value, binaryTree* rootz)
+{
+    if (rootz->height == 0)
+    {
+        addRoot(value,rootz);
+    }
+    
+    rootz->height++;
+}
+int main()
+{
+    int n;
+    binaryTree* bT = iniT();
+    while (scanf("%d",&n) != EOF)
+    {
+        printf("----\nAdicionando %d\n",n);
+        add(n,bT);
+        printTree();
+
+    }   
+    return 0;
+}

hash.c

@@ -1,117 +1,109 @@
-    #include <stdio.h>
-    #include <stdlib.h>
-    #include <string.h>
-    //https://thehuxley.com/problem/242?quizId=6236
-    #define DEBUG if(0)
-    typedef struct _node
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+//https://thehuxley.com/problem/242?quizId=6236
+#define DEBUG if(0)
+typedef struct _node
+{
+    int data;
+    struct _node* next;
+}node;
+typedef struct _list
+{
+    int size;
+    node* tail;
+    node* head;
+}list;
+typedef struct table
+{
+    list* tables[100];
+}table;
+int hashFunction(int value, int base)
+{
+    return value%base;
+}
+list* initList()
+{
+    list* new_list = (list*) malloc (sizeof(list));
+    new_list->head = NULL;
+    new_list->tail = NULL;
+    new_list->size = 0;
+    return new_list;
+}
+table* initTable()
+{
+    table* newTable = (table*) malloc(sizeof(table));
+    for (int i = 0; i < 100; i++)
     {
-        int data;
-        struct _node* next;
-    }node;
-    typedef struct _list
-    {
-        int size;
-        node* tail;
-        node* head;
-    }list;
-    typedef struct table
-    {
-        list* tables[100];
-    }table;
-
-    int hashFunction(int value, int base)
-    {
-        return value%base;
-    }
-    list* initList()
-    {
-        list* new_list = (list*) malloc (sizeof(list));
-        new_list->head = NULL;
-        new_list->tail = NULL;
-        new_list->size = 0;
-        return new_list;
+        newTable->tables[i] = initList();
     }
-    table* initTable()
+    return newTable;
+}
+void addListTail(list* lista, int value)
+{
+    node* new_node = (node*) malloc(sizeof(node));
+    new_node->data = value;
+    new_node->next = NULL;
+    if (lista->size == 0)
     {
-        table* newTable = (table*) malloc(sizeof(table));
-        for (int i = 0; i < 100; i++)
-        {
-            newTable->tables[i] = initList();
-        }
-        return newTable;
-    }
-    void addListTail(list* lista, int value)
-    {
-        node* new_node = (node*) malloc(sizeof(node));
-        new_node->data = value;
-        new_node->next = NULL;
-        if (lista->size == 0)
-        {
-            lista->head = new_node;
-            lista->tail = new_node;
-            lista->size++;
-            return;
-        }
-        lista->tail->next = new_node;
+        lista->head = new_node;
         lista->tail = new_node;
         lista->size++;
+        return;
     }
-
-    void addHashed(table* ht, int value, int key)
+    lista->tail->next = new_node;
+    lista->tail = new_node;
+    lista->size++;
+}
+void addHashed(table* ht, int value, int key)
+{
+    addListTail(ht->tables[key],value);
+}
+void get(int baseNum, int keysNum, table* ht)
+{
+    int value, key;
+    for (int i = 0; i < keysNum; i++)
     {
-        addListTail(ht->tables[key],value);
+        scanf("%d",&value);
+        key = hashFunction(value,baseNum);
+        addHashed(ht,value,key);
     }
-
-    void get(int baseNum, int keysNum, table* ht)
+}
+void printao(list* list, int key)
+{
+    printf("%d -> ", key);
+    node* tmp = list->head;
+    while (tmp != NULL)
     {
-        int value, key;
-        for (int i = 0; i < keysNum; i++)
-        {
-            scanf("%d",&value);
-            key = hashFunction(value,baseNum);
-            addHashed(ht,value,key);
-        }
-        
+        printf("%d -> ", tmp->data);
+        tmp = tmp->next;
     }
-    void printao(list* list, int key)
+    printf("\\");
+    printf("\n");
+}
+void print(table* ht, int keysNum)
+{
+    for (int i = 0; i < keysNum; i++)
     {
-        printf("%d -> ", key);
-        node* tmp = list->head;
-        while (tmp != NULL)
-        {
-            printf("%d -> ", tmp->data);
-            tmp = tmp->next;
-        }
-        printf("\\");
-        printf("\n");
-
+        printao(ht->tables[i],i);
     }
-    void print(table* ht, int keysNum)
+    printf("\n");
+    
+}
+int main()
+{
+    int testNumber;
+    scanf("%d",&testNumber);
+    for (int i = 0; i < testNumber; i++)
     {
-        for (int i = 0; i < keysNum; i++)
-        {
-            printao(ht->tables[i],i);
-        }
-        printf("\n");
-        
+        DEBUG printf("----------- Caso de teste #%d ----------\n",i);
+        int baseNumber, keysNumber;
+        scanf("%d",&baseNumber);
+        scanf("%d",&keysNumber);   
+        DEBUG printf("Base = [%d], Chaves [%d]\n",baseNumber,keysNumber);
+        table* ht = initTable(); 
+        get(baseNumber,keysNumber,ht);
+        print(ht,baseNumber);
     }
-    int main()
-    {
-        int testNumber;
 
-        scanf("%d",&testNumber);
-        for (int i = 0; i < testNumber; i++)
-        {
-            DEBUG printf("----------- Caso de teste #%d ----------\n",i);
-            int baseNumber, keysNumber;
-            scanf("%d",&baseNumber);
-            scanf("%d",&keysNumber);   
-            DEBUG printf("Base = [%d], Chaves [%d]\n",baseNumber,keysNumber);
-
-
-            table* ht = initTable(); 
-            get(baseNumber,keysNumber,ht);
-            print(ht,baseNumber);
-        }
-        
-    }
+}