Non binary decision tree to binary decision tree (Machine learning) <p>This is homework question, so I just need help may be yes/No and few comment will be appreciated!</p> <ul> <li>Prove: Arbitrary tree (NON binary tree) can be converted to equivalent binary decision tree.</li> </ul> <p>My answer: Every decision can be generated just using binary decisions. Hence that decision tree too. I don't know formal proof. Its like I can argue with Entropy(Gain actually) for that node will be E(S) - E(L) - E(R). And before that may be it is E(S) - E(Y|X=t1) - E(Y|X=t2) - and so on.</p> <p>But don't know how to say?!</p>