I have some fundamental code at https://unidef.net.
Basically it goes:
#pragma once
#include “sys.h”
#include “typedefs.h”
// data structures
struct neural {
ID id;
char *description;
NODE *dimension[NEURAL_ARRAY][NEURAL_ARRAY][NEURAL_ARRAY];
} *N;
struct neural_node {
ID id;
DOC description;
ERROR (*exception)(NODE,DOC); // add SYS
NODE *up;
NODE *down;
NODE *left;
NODE *right;
} *NN;
I suck at binary trees, so hopefully someone can make sense out of it. The key is to implement a rolling DMA to collect extra nodes, and using strings and ID numbers to search. It’s not efficient since you have to loop through each BT or define a macro with specific points of the array
Good luck space cowboys and space cowgirls