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 31 32 33 34 35 36 37 38 39 40 41 | #include <stdio.h>
#include <stdlib.h>
typedef struct _Node {
int value;
struct _Node* left;
struct _Node* right;
} Node;
Node* _create_node(int value) {
Node temp = {
.value = value,
.left = NULL,
.right = NULL
};
Node* node = malloc(sizeof(*node));
*node = temp; // Yes, you can assign all of the fields with one statement.
return node;
}
void insert(Node** a_root, int value) {
if(*a_root == NULL) {
*a_root = _create_node(value);
}
else if(value < (*a_root) -> value) {
insert(&(*a_root) -> left, value);
}
else {
insert(&(*a_root) -> right, value);
}
}
int main(int argc, char* argv[]) {
// Make empty tree
Node* root = NULL; // a valid empty tree
insert(&root, 4);
insert(&root, 2);
insert(&root, 6);
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2017 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.