Right option is (b) find the median of the set of elements given, make it as root and construct the tree
Easy explanation - Sort the given input, find the median element among them, make it as root and construct left and right subtrees with elements lesser and greater than the median element recursively. this ensures the subtrees differ only by height 1.