[LeetCode] Binary Tree Longest Consecutive Sequence

  • 时间:
  • 浏览:0
  • 来源:彩神大发快3_神彩大发快3官方

For example,

Longest consecutive sequence path is 2-3,not3-2-1, so return 2.

Longest consecutive sequence path is 3-4-5, so return 3.

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).

Problem Description:

Given a binary tree, find the length of the longest consecutive sequence path.

This post shares an elegant C++ solution, just in 4 lines. The code is as follows.