71 fDepth( p->GetDepth() + 1),
72 fParentTree(p->GetParentTree())
149 std::stringstream s(
"");
168 std::stringstream s(content);
177 n->
ReadXML(ch, tmva_Version_Code);
181 std::cout <<
"neither left nor right" << std::endl;
void * AddXMLTo(void *parent) const
add attributes to XML
int GetCount()
returns the global number of instantiated nodes
virtual void AddAttributesToNode(void *node) const =0
virtual void AddContentToNode(std::stringstream &s) const =0
virtual void ReadAttributes(void *node, UInt_t tmva_Version_Code=TMVA_VERSION_CODE)=0
virtual void SetRight(Node *r)
virtual ~Node()
node destructor
virtual void SetLeft(Node *l)
void ReadXML(void *node, UInt_t tmva_Version_Code=TMVA_VERSION_CODE)
read attributes from XML
virtual void Print(std::ostream &os) const =0
std::ostream & operator<<(std::ostream &os, const BinaryTree &tree)
virtual Node * CreateNode() const =0
virtual Node * GetRight() const
Abstract ClassifierFactory template that handles arbitrary types.
Node for the BinarySearch or Decision Trees.
Int_t CountMeAndAllDaughters() const
recursively go through the part of the tree below this node and count all daughters ...
virtual void ReadContent(std::stringstream &s)=0
virtual Node * GetLeft() const