ImplementInorderSpaceEfficient.java

import java.util.Collections;
import java.util.List;

public class ImplementInorderSpaceEfficient {

    /*
    10.11
    */

    public static List<Integer> inorderTraversal(BinaryTree<Integer> tree) {

        return Collections.emptyList();
    }
}