TMVA::Node

class TMVA::Node

    public:

                           Node(TMVA::Event* e = NULL, Bool_t o = kFALSE)
                           Node(TMVA::Node* p)
                           Node(const TMVA::Node&)
                   virtual ~Node()
            static TClass* Class()
                     Int_t CountMeAndAllDaughters() const
            virtual Bool_t EqualsMe(const TMVA::Event*) const
              TMVA::Event* GetData() const
                    Bool_t GetEventOwnership()
               TMVA::Node* GetLeft() const
               TMVA::Node* GetParent() const
               TMVA::Node* GetRight() const
                   Short_t GetSelector() const
            virtual Bool_t GoesLeft(const TMVA::Event*) const
            virtual Bool_t GoesRight(const TMVA::Event*) const
           virtual TClass* IsA() const
               TMVA::Node& operator=(const TMVA::Node&)
                      void Print(ostream& os) const
              virtual void PrintRec(ostream& os, Int_t depth = 0, const string pos = root) const
      virtual TMVA::NodeID ReadRec(ifstream& is, TMVA::NodeID nodeID, TMVA::Node* parent = NULL)
                      void SetData(TMVA::Event* e)
                      void SetEventOwnership(Bool_t b)
                      void SetLeft(TMVA::Node* l)
                      void SetParent(TMVA::Node* p)
                      void SetRight(TMVA::Node* r)
                      void SetSelector(Short_t i)
                      void SetSelector(Int_t i)
              virtual void ShowMembers(TMemberInspector& insp, char* parent)
              virtual void Streamer(TBuffer& b)
                      void StreamerNVirtual(TBuffer& b)

Data Members

    private:

      TMVA::Event* fEvent           event that forms the node (search tree)
       TMVA::Node* fLeft            pointers to the two "daughter" nodes
       TMVA::Node* fRight           pointers to the two "daughter" nodes
       TMVA::Node* fParent          the previous (parent) node
           Short_t fSelector        index of variable used in node selection (decision tree) 
            Bool_t fEventOwnership  flag if Event* is owned by the node or not

_______________________________________________________________________

 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.
______________________________________________________________________

 node destructor

 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 go through the part of the tree below this node and count all daughters

print the node

recursively print the node and its daughters (--> print the 'tree')

recursively read the node and its daughters (--> print the 'tree')

 constructor of a node for the search tree

 constructor of a daughter node as a daughter of 'p'

 return pointer to the parent node

 set pointer to the parent node

 set index of variable used for discrimination at this node

 set index of variable used for discrimination at this node

 return index of variable used for discrimination at this node

 set the EVENT that forms this node (in search tree)

 return the EVENT that forms this node (in search tree)

 return true/false if the EVENT* that forms the node is owned by the node or not

 set if the EVENT* that forms the node is owned by the node or not