summaryrefslogtreecommitdiff
path: root/lib/tree.c
diff options
context:
space:
mode:
authorJaron Kent-Dobias <jaron@kent-dobias.com>2018-07-26 01:21:56 -0400
committerJaron Kent-Dobias <jaron@kent-dobias.com>2018-07-26 01:21:56 -0400
commitde8c6398f269c9fa14842c170b5b21651e817f9b (patch)
tree09b1fab1bf6e9993becceba305f8a858c1069615 /lib/tree.c
parent94f7d887981f0626f166f5645fa98115d4f9a478 (diff)
downloadc++-de8c6398f269c9fa14842c170b5b21651e817f9b.tar.gz
c++-de8c6398f269c9fa14842c170b5b21651e817f9b.tar.bz2
c++-de8c6398f269c9fa14842c170b5b21651e817f9b.zip
removed some files that are now unused
Diffstat (limited to 'lib/tree.c')
-rw-r--r--lib/tree.c81
1 files changed, 0 insertions, 81 deletions
diff --git a/lib/tree.c b/lib/tree.c
deleted file mode 100644
index 081f1d1..0000000
--- a/lib/tree.c
+++ /dev/null
@@ -1,81 +0,0 @@
-
-#include "tree.h"
-
-node_t *tree_createNode(v_t value, v_t level, node_t *left, node_t *right) {
- node_t *node = (node_t *)malloc(sizeof(node_t));
-
- node->value = value;
- node->level = level;
- node->left = left;
- node->right = right;
-
- return node;
-}
-
-void tree_freeNode(node_t *node) {
- if (node != NULL) {
- tree_freeNode(node->left);
- tree_freeNode(node->right);
- free(node);
- }
-}
-
-void tree_skew(node_t **T) {
- if (*T != NULL) {
- if ((*T)->left != NULL) {
- if ((*T)->left->level == (*T)->level) {
- node_t *L = (*T)->left;
- (*T)->left = L->right;
- L->right = (*T);
-
- *T = L;
- }
- }
- }
-}
-
-void tree_split(node_t **T) {
- if (*T != NULL) {
- if ((*T)->right != NULL) {
- if ((*T)->right->right != NULL) {
- if ((*T)->level == (*T)->right->right->level) {
- node_t *R = (*T)->right;
- (*T)->right = R->left;
- R->left = *T;
- R->level = R->level + 1;
- *T = R;
- }
- }
- }
- }
-}
-
-void tree_insert(node_t **T, v_t x) {
- if (*T == NULL) {
- *T = tree_createNode(x, 1, NULL, NULL);
- } else if (x < (*T)->value) {
- node_t *L = (*T)->left;
- tree_insert(&L, x);
- (*T)->left = L;
- } else if (x > (*T)->value) {
- node_t *R = (*T)->right;
- tree_insert(&R, x);
- (*T)->right = R;
- }
-
- tree_skew(T);
- tree_split(T);
-}
-
-bool tree_contains(node_t *T, v_t x) {
- if (T == NULL) {
- return false;
- } else if (x < T->value) {
- return tree_contains(T->left, x);
- } else if (x > T->value) {
- return tree_contains(T->right, x);
- } else {
- return true;
- }
-}
-