class TMVA::BinaryTree


Base class for BinarySearch and Decision Trees

Function Members (Methods)

This is an abstract class, constructors will not be documented.
Look at the header to check for available constructors.

public:

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
virtual TClass*	IsA() const
void	Print(ostream& os) const
void	Read(istream& istr)
void	SetRoot(TMVA::Node* r)
virtual void	ShowMembers(TMemberInspector& insp, char* parent)
virtual void	Streamer(TBuffer& b)
void	StreamerNVirtual(TBuffer& b)

protected:

void	DeleteNode(TMVA::Node*)

Data Members

protected:

TMVA::MsgLogger	fLogger	message loggera
Int_t	fNNodes	total number of nodes in the tree (counted)

private:

TMVA::Node*	fRoot	the root node of the tree

Class Charts

Inheritance Inherited Members Includes Libraries

Function documentation

~BinaryTree( void )

destructor (deletes the nodes and "events" if owned by the tree

void DeleteNode(TMVA::Node* )

 protected, recursive, function used by the class destructor and when Pruning

TMVA::Node* GetLeftDaughter(TMVA::Node* n)

 get left daughter node current node "n"

TMVA::Node* GetRightDaughter(TMVA::Node* n)

 get right daughter node current node "n"

UInt_t CountNodes(TMVA::Node* n = NULL)

 return the number of nodes in the tree. (make a new count --> takes time)

void Print(ostream& os) const

recursively print the tree

void Read(istream& istr)

 recursively read the tree

Node * CreateNode()

void SetRoot(TMVA::Node* r)

 set the root node of the tree

{ fRoot = r; }

Node* GetRoot()

 Retrieves the address of the root node

{ return fRoot; }

UInt_t GetNNodes()

 get number of Nodes in the Tree as counted while booking the nodes;

{ return fNNodes; }

Author: Andreas Hoecker, Joerg Stelzer, Helge Voss, Kai Voss
Last update: root/tmva $Id: BinaryTree.cxx,v 1.12 2007/06/19 13:26:21 brun Exp $
Copyright (c) 2005: *

This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.