Most programmers and users resort to find individual solution per problem depending on the data and nature of problem, that will lead to solve a specific problem using an algorithm without the ability of this solution to solve a new problem. This variance comes from the difference in algorithm parameters from one problem to another, as these parameters related to data nature, its size, and values it carried that can affect the way algorithm work. Individual solutions lead to increase in time cost and effort spent on solving a new problem, which the new problem requires to work on programming new criteria for algorithm solution. That is prompted us to highlight necessaries to develop main components for algorithms used in practical life, such as data mining algorithms so that a solution designed for one problem can be more easily adapted to new problems with different data structures, within the general scope of decision tree applicability. These algorithm components need control mechanism settings, so when using component to solve problem, there is no need to develop algorithm settings again, regardless data size and data structure. We found that the dynamic solution saves effort and time needed to solve problems with same algorithm. In this paper, we present our methodology for using ID3 decision tree algorithm to mine data dynamically, and the mechanism used to achieve the dynamic solution, that provides a flexible and reusable solution for a wide range of problems that require decision tree support, reducing the need to redesign or reimplement models for each new task The proposed model was tested on three datasets. The proposed model achieved an accuracy of 97%, 97%, and 93% on the breast cancer, heart disease, and diabetes datasets, respectively.