A Section 3 details

We prove Lemma 4. Lemma 4 (restated). For a given node x, suppose the adversary shows x to the learner. In this section, the proofs omitted in Section 4 are presented. B.1 Proof of Theorem 8 We first define sub-trees. Let T be a binary tree.