The binary expansion and the intermediate value theorem in constructive reverse mathematics

We introduce the notion of a convex tree. We show that the binary expansion for real numbers in the unit interval ( BE ) is equivalent to weak König lemma ( WKL ) for trees having at most two nodes at each level, and we prove that the intermediate value theorem is equivalent to WKL for convex trees, in the framework of constructive reverse mathematics.