but not sure we can add new dimensions to an array on the fly which ideally is what you want to do
its really a job for pointer arithmetic so not sure how in tier1
ideally something like
type _nodetype
id as integer
prevNode as integer
nextNode as integer
endtype
type _nodes
node as _nodetype[2]
endtype
nodes as _nodes[]
but you need to be able to add nodes to each nodetype which logically is a mess
but it may be able to be achieved with memblocks if you setup what is needed for each node with its pairing two nodes
with space left to store the values in memory you want ie 3 integers. Then whenever you wanted to add nodes to the
tree you would have to create a new memblock calculating its new size and then add the values. A bit like how linked lists
work but in c its done by the use of pointers. The beauty is if you know the id its very fast to search through the tree to
find other data
Why do you need tree data?
fubar