lintcode阶梯训练第三关（九章） - Dashuai_Liu的博客 - 博客频道 - CSDN.NET
595、Binary Tree Longest Consecutive Sequence
题目
Given a binary tree, find the length of the longest consecutive sequence path.
The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The longest consecutive path need to be from parent to child (cannot be the reverse).
Read full article from lintcode阶梯训练第三关（九章） - Dashuai_Liu的博客 - 博客频道 - CSDN.NET
No comments:
Post a Comment