Showing:
Handle Score
@Ibrahim Nash 5725
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Longest consecutive sequence in Binary tree
Easy Accuracy: 42.31% Submissions: 9807 Points: 2

Given a Binary Tree find the length of the longest path which comprises of nodes with consecutive values in increasing order.
Note: Sequence of length 1 won't be considered.

Example 1:

Input :
1
/   \
2     3

Output: 2

Explanation : Longest sequence is 1, 2.

Example 2:

Input :
10
/     \
20       30
/  \      /
40      60   90

Output :  -1

Explanation: For the above test case no
sequence is possible. So output is -1.

You dont need to read input or print anything. Complete the function longestConsecutive() which takes root node as input parameter and returns the length of the longest consecutive increasing sequence (of at least
length 2) in the given Binary Tree. If such a sequence does not exist, it returns -1.

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(Height of Tree)

Constraints:
1 ≤ N ≤ 10^3