1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
#include "miniunit.h"

typedef struct _BSTNode {
    int value;
    struct _BSTNode* left;
    struct _BSTNode* right;
} BSTNode;

void insert(int value, BSTNode** a_root) {
    BSTNode* new_node = malloc(sizeof(*new_node));
    *new_node = (BSTNode) { .value = value, .left = NULL, .right = NULL };
    *a_root = new_node;  // fine for tree of size 1
}

int main(int argc, char* argv[]) {
    // size == 0  (empty tree)
    BSTNode* root = NULL;

    insert(4, &root);
    assert(root -> value == 4); // will crash program (intentionally) if condition is false
    printf("root -> value == %d\n", root -> value);
    
    // TODO:  Free the BST
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */

© Copyright 2022 Alexander J. Quinn         This content is protected and may not be shared, uploaded, or distributed.