I am working from presentation from school, but I am not able to understand how they go from one step to the other. This is the decision table that I have.
From it, the first thing we have to do is to choose the root node among these nodes:
But I do not understand why for example from Q1 the Y branch has a1, a2 and the N branch has a1,a3.
This is then the final solution for the tree:
I am not sure if this is the correct name in English, maybe that's the reason I wasn't able to find any literature online.
I would appreciate an explanation or at least a link to a guide on how to convert decision tables to optimal decision trees that are consistent with the decision table.