LC: 298. Binary Tree Longest Consecutive Sequence

https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/

298. Binary Tree Longest Consecutive Sequence

Given the root of a binary tree, return 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 needs to be from parent to child (cannot be the reverse).

Example 1:

Input: root = [1,null,3,2,4,null,null,null,5]
Output: 3
Explanation: Longest consecutive sequence path is 3-4-5, so return 3.

Example 2:

Input: root = [2,null,3,2,null,1]
Output: 2
Explanation: Longest consecutive sequence path is 2-3, not 3-2-1, so return 2.

Constraints:

The number of nodes in the tree is in the range [1, 3 * 104].
-3 * 104 <= Node.val <= 3 * 104

Details:

Ob die Folgen fortlaufend sind, können wir dadurch kontrollieren, dass wir die Werte der Elter- und Kindknoten vergleichen. Man kann die Kindknoten die Werte ihrer Eltern eingeben oder die Elterknoten die Werte ihrer Kinder zurückgeben. In dem Basisfall sollen die Blätter des Baums 1 zurückgeben. Durch Addition zu der Längen und Vergleich wird die längsten Folge am Ende bestimmt. Die Traversierung soll hier der Nebenreihenfolge (L-R–N) entsprechen.

Solution(s) and Further Explanation:

298. Binary Tree Longest Consecutive Sequence by ErdemT09 · Pull Request #300 · spiralgo/algorithmsGitHub

Default Code:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int longestConsecutive(TreeNode root) {
        
    }
}

PreviousLC: 549. Binary Tree Longest Consecutive Sequence II NextLC: 314. Binary Tree Vertical Order Traversal

Last updated 3 years ago