if you want to view the data this makes, see https://scratch.mit.edu/projects/1074098551/ data structure i made, fairly simple (mumbo jumbo ahh statement) its a tree made up of nodes that can have as many children as you want (including zero!!!), and store a value the reason its called a linked tree because it uses a method similar to a linked list, each node has a collection of pointers to children and each child pointer has a pointer to the next child pointer. child pointers. the reason why i made it be a tangle of pointers is so that it doesnt need to use the insert function, which i think shoves each element individually, and that can cause lag. i recommend you use a stack with this, as this is just the bare essentials. free to use, you can give credit if you want but you dont need to. also you have to be pro furry to use this data type :3
