Converting decision tree into a logical expression

Question

I need to convert this decision tree into a logical expression by using "and", "or" and "not" logical operators. I have been trying to solve this for 3 days. Any help would be appreciated.

Answer 1

I assume $0$ means False and $1$ means true.

Look at the leaves, see whether there are more $0$ or $1$. I will pick the one with less leaves.

There are two leaves with value $0$. One path is $F=0, H=1, J=0$. The other path is $F=1, G=0, K=0$.

\begin{align}&\neg \left( \left( \neg F \wedge H \wedge \neg J\right) \vee \left( F \wedge \neg G \wedge \neg K \right) \right) \\&=(F \vee \neg H \vee J) \wedge (\neg F \vee G \vee K)\end{align}

Answer 2

It's $$(\neg F \wedge \neg H) \vee (\neg F \wedge H \wedge J) \vee (F \wedge G) \vee (F \wedge \neg G \wedge K)$$

(Here '$\wedge$' means 'and', '$\vee$' means 'or' and '$\neg$' means 'not'.)