BinaryTree Base class for BinarySearch and Decision Trees
virtual | ~BinaryTree() |
virtual void* | AddXMLTo(void* parent) const |
TMVA::BinaryTree | BinaryTree() |
TMVA::BinaryTree | BinaryTree(const TMVA::BinaryTree&) |
static TClass* | Class() |
virtual const char* | ClassName() const |
UInt_t | CountNodes(TMVA::Node* n = __null) |
virtual TMVA::Node* | CreateNode(UInt_t size = 0) const |
virtual TMVA::BinaryTree* | CreateTree() const |
TMVA::Node* | GetLeftDaughter(TMVA::Node* n) |
UInt_t | GetNNodes() const |
TMVA::Node* | GetRightDaughter(TMVA::Node* n) |
virtual TMVA::Node* | GetRoot() const |
UInt_t | GetTotalTreeDepth() const |
virtual TClass* | IsA() const |
TMVA::BinaryTree& | operator=(const TMVA::BinaryTree&) |
virtual void | Print(ostream& os) const |
virtual void | Read(istream& istr, UInt_t tmva_Version_Code = 262657) |
virtual void | ReadXML(void* node, UInt_t tmva_Version_Code = 262657) |
void | SetRoot(TMVA::Node* r) |
void | SetTotalTreeDepth(Int_t depth) |
void | SetTotalTreeDepth(TMVA::Node* n = __null) |
virtual void | ShowMembers(TMemberInspector& insp) const |
virtual void | Streamer(TBuffer&) |
void | StreamerNVirtual(TBuffer& ClassDef_StreamerNVirtual_b) |
constructor for a yet "empty" tree. Needs to be filled afterwards
protected, recursive, function used by the class destructor and when Pruning
return the number of nodes in the tree. (make a new count --> takes time)
Read the binary tree from an input stream. The input stream format depends on the tree type, it is defined be the node of the tree
descend a tree to find all its leaf nodes, fill max depth reached in the tree at the same time.
or a tree with Root node "n", any daughters of this node are automatically in the tree
virtual BinaryTree* CreateFromXML(void* node, UInt_t tmva_Version_Code = TMVA_VERSION_CODE) = 0;
get number of Nodes in the Tree as counted while booking the nodes;
{ return fNNodes; }