Consider the following decision tree fragment:

Decision Tree Fragment

Can this be reduced to one decision node? For each decision, can it be further reduced to one outcome node? What does this look like?

Yes. However, changing the problem reduces the second decision $($e$.$g$.,$ in the fragment above, eliminating node $2$ and beyond$).$

No$.$ For example, the outcome at node A must be known before a decision is made at node $2.$

Yes, for each decision at node $1,$ pick in advance what you will decide after the outcome. In the fragment above, this means that a decision includes the choice at node $1$ and node $2.$

No$,$ each possible path through the tree represents a decision but not an outcome.