removes a bunch of stuff:

.gitignore

@@ -1 +1,6 @@
 node_modules/*
+*.exe
+*.pdf
+*.obj
+*.ilk
+*.out

.vscode/tasks.json

@@ -3,7 +3,7 @@
     "tasks": [
       {
         "type": "shell",
-        "label": "C/C++: cl.exe build active file",
+        "label": "C/C++: build active file",
         "windows": {
           "command": "cl.exe",
           "args": [

c/binary-search.c

@@ -0,0 +1,53 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+typedef struct ArrayList {
+    int capacity;
+    int index;
+    int data[];
+} ArrayList;
+
+ArrayList* new_arraylist(int cap) {
+    ArrayList* arr = malloc(sizeof(ArrayList) + cap * sizeof(int));
+    arr->capacity = cap;
+    arr->index = 0;
+    for (int i = 0; i < cap; i++) {
+        arr->data[i] = 0;
+    }
+
+    return arr;
+}
+
+void push_to_array(ArrayList* s, int v) {
+    if (s->index == s->capacity) {
+        printf("you attempted to insert %d, but array is at capacity cannot add mode values\n", v);
+    } else {
+        s->data[s->index] = v;
+        s->index++;
+    }
+}
+
+void pop_from_array(ArrayList* s) {
+    if (s->index == 0) {
+        printf("there is nothing to remove!\n");
+    } else {
+        s->index--;
+    }
+}
+
+typedef struct BinaryNode {
+    int                value;
+    struct BinaryNode* left;
+    struct BinaryNode* right;
+} BinaryNode;
+
+BinaryNode* new_binary_node(int value) {
+    BinaryNode* node = malloc(sizeof(BinaryNode));
+    node->value = value;
+
+    return (node);
+}
+
+int main() {
+    return (0);
+}

c/linked_list.c

@@ -80,18 +80,17 @@ void insert_at(LinkedList *list, Node *node, int index) {
     }
 }
 
-void remove_at_end(LinkedList* list) {
+void remove_at_end(LinkedList *list) {
     if (list->length == 0) {
         printf("ERROR: cannot remove from an empty list\n");
     } else {
-        Node* node_to_remove = list->tail;
+        Node *node_to_remove = list->tail;
         list->tail = node_to_remove->prev;
         list->tail->next = NULL;
         free(node_to_remove);
     }
 }
 
-
 int get_length(LinkedList *list) {
     return (list->length);
 }
@@ -121,16 +120,16 @@ void print_list(LinkedList *list) {
     printf("] <length: %d>\n", get_length(list));
 }
 
-LinkedList* new_list_from_array(int arr[], int length) {
+LinkedList *new_list_from_array(int arr[], int length) {
     if (length == 0) {
         printf("ERROR: i mean c'mon");
     }
-    LinkedList* list = new_linked_list();
+    LinkedList *list = new_linked_list();
-    Node*       n = new_node(arr[1]);
+    Node       *n = new_node(arr[1]);
     list->head = n;
     list->length++;
     for (int i = 1; i < length; i++) {
-        Node* n = new_node(arr[i]);
+        Node *n = new_node(arr[i]);
         append(list, n);
     }
 
@@ -138,10 +137,10 @@ LinkedList* new_list_from_array(int arr[], int length) {
 }
 
 int main() {
-    LinkedList* list = new_linked_list();
+    LinkedList *list = new_linked_list();
 
-    Node* a = new_node(10);
+    Node *a = new_node(10);
-    Node* b = new_node(11);
+    Node *b = new_node(11);
     preppend(list, a);
     print_list(list);
     preppend(list, b);
@@ -181,11 +180,7 @@ int main() {
     print_list(list);
     remove_at_end(list);
     print_list(list);
-
-    int first_node_val = get_val(list, 1);
-    printf("the value at the first node is: %d\n", first_node_val);
     destroy_list(list);
 
     return (0);
 }
-