//this function is recursivly called from/for all branches on a tree

tid = global.tid
tid.slots +=1
tid.slot[tid.slots] = id


if(open = true){
//add branches
n=1
while(n<= branches){
//tid.slots +=1
//tid.slot[tid.slots] = branch[n]
//cause it gets filled when you call it, if you do it here it gets added twice
with(branch[n]){
tree_fill() // recursive function lol
}
n+=1
}
//add leaves
n=1
while(n<= leaves){
tid.slots +=1
tid.slot[tid.slots] = leaf[n]
n+=1
}


}