Added the OLD_ suffix to the CPT_Predictor in to make a usable backup prior to remove the Recursive Divider strategy.
Made a replica of OLD_CPT, this version is going to be used to remove the Recursive Divider strategy.
Updated the tag for OLD_CPT
Remove useless and unused method SetBitAndIncrementCardinality(int i)
Renamed OLD_CPT to CPT11
Reimplemented the recursive divider but without repetition, it has a good impact on the testing time.

Also added the removeUnseenItem in the CPTHelper.
Implemented TDAG algorithm based on markov trees.
Only one optimization implemented: dictionnary to lookup node
Added MaxTreeHeight optimization to TDAG predictor (reduce by a factor of 2-3 the spatial complexity)
Removed bin/
Minor changes to estimate the number of bi-pattern saving in CPT.
A bi-pattern is a set of two consecutive items. So far, it shows we can save
up to 1/3 of the nodes in CPT.
Implemented the LZ78 compression algorithm as a new predictor.

See the pseudo code at: http://oldwww.rasip.fer.hr/research/compress/algorithms/fund/lz/lz78.html
Small fix in CPT where the lift was not calculated the right way