virtual | ~BinaryTree() |
static TClass* | Class() |
UInt_t | CountNodes(TMVA::Node* n = NULL) |
virtual TMVA::Node* | CreateNode() |
TMVA::Node* | GetLeftDaughter(TMVA::Node* n) |
UInt_t | GetNNodes() const |
TMVA::Node* | GetRightDaughter(TMVA::Node* n) |
TMVA::Node* | GetRoot() const |
UInt_t | GetTotalTreeDepth() const |
virtual TClass* | IsA() const |
void | Print(ostream& os) const |
void | Read(istream& istr) |
void | SetRoot(TMVA::Node* r) |
void | SetTotalTreeDepth(Int_t depth) |
void | SetTotalTreeDepth(TMVA::Node* n = NULL) |
virtual void | ShowMembers(TMemberInspector& insp, char* parent) |
virtual void | Streamer(TBuffer& b) |
void | StreamerNVirtual(TBuffer& b) |
void | DeleteNode(TMVA::Node*) |
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.
get number of Nodes in the Tree as counted while booking the nodes;
{ return fNNodes; }