#include <classifier_rf.hpp>
one CART node; left<0 marks a leaf (leaf_class valid), otherwise feature/threshold/left/right. A tree is a flat vector of these: the root is always index 0, and a split appends its two children at the end of the vector, so child indices always exceed the parent's.