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