BinarySearchTreeNode Node for the BinarySearch or Decision Trees. For the binary search tree, it basically consists of the EVENT, and pointers to the parent and the 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.
| virtual Bool_t | ReadDataRecord(istream& is) |
constructor of a daughter node as a daughter of 'p'
copy constructor of a node. It will result in an explicit copy of the node an drecursively all it's daughters
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 print the node and its daughters (--> print the 'tree')
set index of variable used for discrimination at this node
{ fSelector = i; }