Problem description: Visit and Support LintCode Search via Difficulty: Easy Tags: LintCode, Binary Search Trees, O(nlogn), O(n), Easy, BST, Heap ProblemSolutionCodeProblem