BinaryTree.h

Go to the documentation of this file.

// @(#)root/tmva $Id$
// Author: Andreas Hoecker, Joerg Stelzer, Helge Voss, Kai Voss, Eckhard von Toerne
 
/**********************************************************************************
 * Project: TMVA - a Root-integrated toolkit for multivariate data analysis       *
 * Package: TMVA                                                                  *
 * Class  : BinaryTree                                                            *
 * Web    : http://tmva.sourceforge.net                                           *
 *                                                                                *
 * Description:                                                                   *
 *      BinaryTree: A base class for BinarySearch- or Decision-Trees              *
 *                                                                                *
 * Authors (alphabetical):                                                        *
 *      Andreas Hoecker <Andreas.Hocker@cern.ch> - CERN, Switzerland              *
 *      Helge Voss      <Helge.Voss@cern.ch>     - MPI-K Heidelberg, Germany      *
 *      Kai Voss        <Kai.Voss@cern.ch>       - U. of Victoria, Canada         *
 *      Eckhard v. Toerne  <evt@uni-bonn.de>     - U of Bonn, Germany             *
 *                                                                                *
 * Copyright (c) 2005-2011:                                                       *
 *      CERN, Switzerland                                                         *
 *      U. of Victoria, Canada                                                    *
 *      MPI-K Heidelberg, Germany                                                 *
 *      U. of Bonn, Germany                                                       *
 *                                                                                *
 * Redistribution and use in source and binary forms, with or without             *
 * modification, are permitted according to the terms listed in LICENSE           *
 * (http://tmva.sourceforge.net/LICENSE)                                          *
 **********************************************************************************/
 
#ifndef ROOT_TMVA_BinaryTree
#define ROOT_TMVA_BinaryTree
 
#include "TMVA/Version.h"
 
//////////////////////////////////////////////////////////////////////////
//                                                                      //
// BinaryTree                                                           //
//                                                                      //
// Base class for BinarySearch and Decision Trees                       //
//                                                                      //
//////////////////////////////////////////////////////////////////////////
 
#include <iosfwd>
#include "TROOT.h"
 
#include "TMVA/Node.h"
 
// -----------------------------------------------------------------------------
 
// the actual tree class
// Handles allocation, deallocation, and sorting of nodes.
// the Tree consists of a "root-node" wich might have  0 to 2 daughter nodes
 
namespace TMVA {
 
   class BinaryTree;
   class MsgLogger;
 
   std::ostream& operator<< ( std::ostream& os, const BinaryTree& tree );
   std::istream& operator>> ( std::istream& istr,     BinaryTree& tree );
 
   class BinaryTree {
 
      friend std::ostream& operator<< ( std::ostream& os, const BinaryTree& tree );
      friend std::istream& operator>> ( std::istream& istr,     BinaryTree& tree );
 
   public:
 
      // or a tree with Root node "n", any daughters of this node are automatically in the tree
      BinaryTree( void );
 
      virtual ~BinaryTree();
 
      virtual Node* CreateNode(UInt_t size=0) const = 0;
      virtual BinaryTree* CreateTree() const = 0;
      //      virtual BinaryTree* CreateFromXML(void* node, UInt_t tmva_Version_Code = TMVA_VERSION_CODE) = 0;
      virtual const char* ClassName() const = 0;
 
      // set the root node of the tree
      void SetRoot( Node* r ) { fRoot = r; }
 
      // Retrieves the address of the root node
      virtual Node* GetRoot() const { return fRoot; }
 
      // get number of Nodes in the Tree as counted while booking the nodes;
      UInt_t GetNNodes() const { return fNNodes; }
 
      // count the number of Nodes in the Tree by looping through the tree and updates
      // the stored number. (e.g. useful when pruning, as the number count is updated when
      // building the tree.
      UInt_t CountNodes( Node* n = nullptr );
 
      UInt_t GetTotalTreeDepth() const { return fDepth; }
 
      void SetTotalTreeDepth( Int_t depth ) { fDepth = depth; }
      void SetTotalTreeDepth( Node* n = nullptr );
 
      Node* GetLeftDaughter ( Node* n);
      Node* GetRightDaughter( Node* n);
 
      virtual void Print( std::ostream& os ) const;
      virtual void Read ( std::istream& istr, UInt_t tmva_Version_Code = TMVA_VERSION_CODE );
      virtual void* AddXMLTo(void* parent) const;
      virtual void  ReadXML(void* node, UInt_t tmva_Version_Code = TMVA_VERSION_CODE );
 
   private:
 
 
   protected:
      Node*      fRoot; ///< the root node of the tree
                        ///< the tree only has it's root node, the "daughters" are taken care
                        ///< of by the "node" properties of the "root"
 
      // delete a node (and the corresponding event if owned by the tree)
      void       DeleteNode( Node* );
 
      UInt_t     fNNodes;           ///< total number of nodes in the tree (counted)
      UInt_t     fDepth;            ///< maximal depth in tree reached
 
      MsgLogger& Log() const;
 
      ClassDef(BinaryTree,0); // Base class for BinarySearch and Decision Trees
   };
 
} // namespace TMVA
 
#endif