Problem description: Visit and Support LintCode Search via Difficulty: Medium Tags: LintCode, Recursion, O(n), O(h), Medium, Segment Tree, BST ProblemSolutionCodeProblem