public static void main(String args[]) {
        MinimumHeightTree mht = new MinimumHeightTree();
        int input[][] = {{1,0},{1,2},{1,3}};
        List<Integer> result = mht.findMinHeightTrees(4, input);
        result.forEach(r -> System.out.print(r + " "));
    }
Date 03/08/2016
@author Tushar Roy

Given a graph representing a tree. Find all minimum height trees.

Time complexity O(n)
Space complexity O(n)

https://leetcode.com/problems/minimum-height-trees/
src/com/interview/graph/MinimumHeightTree.java