Node for the BinarySearch or Decision Trees for the binary search tree, it basically consists of the EVENT, and pointers to the parent and daughters in case of the Decision Tree, it specifies parent and daughters, as well as "which variable is used" in the selection of this node, including the respective cut value.
virtual void | ReadAttributes(void* node, UInt_t tmva_Version_Code = 262656) |
virtual void | ReadContent(stringstream& s) |
virtual Bool_t | ReadDataRecord(istream& is, UInt_t tmva_Version_Code = 262656) |
UInt_t | TMVA::Node::fDepth | depth of the node within the tree (seen from root node) |
TMVA::Node* | TMVA::Node::fLeft | pointers to the two "daughter" nodes |
TMVA::Node* | TMVA::Node::fParent | the previous (parent) node |
TMVA::BinaryTree* | TMVA::Node::fParentTree | pointer to the parent tree to which the Node belongs |
char | TMVA::Node::fPos | position, i.e. it is a left (l) or right (r) daughter |
TMVA::Node* | TMVA::Node::fRight | pointers to the two "daughter" nodes |
constructor of a node for the search tree
constructor of a daughter node as a daughter of 'p'
copy constructor of a node. It will result in an explicit copy of the node and recursively all it's daughters
check if the event fed into the node goes/decends to the right daughter
check if the event fed into the node goes/decends to the left daughter
check if the event fed into the node actually equals the event that forms the node (in case of a search tree)
recursively print the node and its daughters (--> print the 'tree')
set index of variable used for discrimination at this node
{ fSelector = i; }
return index of variable used for discrimination at this node
{ return fSelector; }