Question d’entretien chez TubeMogul

1. Convert a sorted array into a binary tree, and then parallelize the algorithm. 2. Get the intersection of two lists.