Implemented leaf-nodes mechanism for ADTree.
When count of a node is small than preset number (currently hardcoded)
no more nodes are stored beneath this node and calculations are redone
whenever they are required.
Continued work on optimizing LazyADTree data structure.
Still figuring out improvements
Made improvements to continous variable data structure as well
Some house cleaning prior to merging back into other branch