LeetCode Q298: 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).

For example,

   1
    \
     3
    / \
   2   4
        \
         5

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

   2
    \
     3
    / 
   2    
  / 
 1

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

Solution:

	/**
	* Definition for a binary tree node.
	* struct TreeNode {
	* int val;
	* TreeNode *left;
	* TreeNode *right;
	* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
	* };
	*/
	class Solution {
	public:
	void helper(TreeNode* node, int lastVal, int curLen, int& maxLen){
	if(node==NULL)
	return;
	if(node->val == lastVal+1){
	maxLen = max(maxLen, curLen+1);
	}else
	curLen = 0;
	helper(node->left, node->val, curLen+1, maxLen);
	helper(node->right, node->val, curLen+1, maxLen);
	}
	int longestConsecutive(TreeNode* root) {
	if(!root)
	return 0;
	int maxLen = 1;
	helper(root->left, root->val, 1, maxLen);
	helper(root->right, root->val, 1, maxLen);
	return maxLen;
	}
	};

view raw Q298.cpp hosted with ❤ by GitHub