Time complexity to insert one element is O(log N), so to insert N elements it should be O(N log N) How is the Answer - O(N)?
