Problem description: Visit and Support LintCode Search via Difficulty: Medium Tags: LintCode, Binary Search Trees, O(klog(min(m, n, k))), O(min(m, n, k)), Medium, BST, Heap ProblemSolutionCodeProblem