Hello,
I'm trying to devise a method for searching an octree in a particular way. To elaborate, I'm using the struct:-
Given generation of a tree of these structs 9 "levels" deep (0-8), and with only the structs at level 8 having a value for count, I want to find the struct that has the lowest of the counts, or the first one with the lowest. Could anyone give any clues?Code:typedef struct TAGoctree { unsigned long count; int level; struct TAGoctree *children[8]; } node;