Find closest greater value for every element in array

Given an array of integers, find the closest greater element for every element. If there is no greater element then print -1

Examples: 

Input : arr[] = {10, 5, 11, 6, 20, 12} 
Output : 11 6 12 10 -1 20

Input : arr[] = {10, 5, 11, 10, 20, 12} 
Output :z 11 10 12 11 -1 20 

A simple solution is to run two nested loops. We pick an outer element one by one. For every picked element, we traverse remaining array and find closest greater element. The time complexity of this solution is O(n*n)

A better solution is to use sorting. We sort all elements, then for every element, traverse toward right until we find a greater element (Note that there can be multiple occurrences of an element).

An efficient solution is to use Self Balancing BST (Implemented as set in C++ and TreeSet in Java). In a Self Balancing BST, we can do both insert and closest greater operations in O(Log n) time

Implementation:

11 10 12 11 -1 20 

Time Complexity: O(n Log n)