Problem description: Visit and Support LintCode Search via Difficulty: Hard Tags: LintCode, Binary Search Trees, O(nlogn), O(n), Hard, BST, BIT, Divide and Conquer, Merge Sort ProblemSolutionCodeProblem