Problem description: Visit and Support LintCode Search via Difficulty: Easy Tags: LintCode, Depth-First Search, O(n), O(h), Easy, LeetCode ProblemSolutionCodeProblem