||The algorithm is realized by DecTreeMethod.Classify and is only general - the same for every methods (for CART like for ID3).
||Checking of some prerequisites:
1. The decision tree exists.
2. The data for classification is selected.
Then the new version of data is created (according to the user chosen name) as the descendant of the actual version.
Then all the data is putted into first node of the tree. It means that all the records in the table will have number 1 in node column.