Recursive stack blowout demonstration

inordertree.c

#include <stdio.h>
#include <stdbool.h>

struct node {
    void *val;
    struct node *left, *right;
};

void in_order_traverse(const struct node *n, void (*callback)(const void *), size_t depth)
{
    printf("%zu\n", depth);
    if(n->left)
        in_order_traverse(n->left, callback, depth + 1);
    callback(n->val);
    if(n->right)
        in_order_traverse(n->right, callback, depth + 1);
}

void dummy_callback(const void *val) { }

int main()
{
    struct node tree[2] = {0};
    
    tree[0].left = &tree[1];
    tree[1].left = &tree[0];
    in_order_traverse(tree, dummy_callback, 1);
}