## Question

Given a tree, write a function to find the length of the longest branch of nodes in increasing consecutive order.

eg.

`length = 3`

Once you think that you’ve solved the problem, click below to see the solution.

*As always, remember that practicing coding interview questions is as much about how you practice as the question itself. Make sure that you give the question a solid go before skipping to the solution. Ideally if you have time, write out the solution first by hand and then only type it into your computer to verify your work once you've verified it manually. To learn more about how to practice, check out this blog post.*

## Solution

How was that problem? You can check out the solution in the video below.

Here is the source code for the solution shown in the video:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 |
private class Node { int value; Node left; Node right; } public int consecutive(Node n) { if (n == null) return 0; return max(consecutive(n.left, n.value, 1), consecutive(n.right, n.value, 1)); } public int consecutive(Node n, int prev, int length) { if (n == null) return length; if (n.value == prev + 1) { int leftLength = consecutive(n.left, n.value, length + 1); int rightLength = consecutive(n.right, n.value, length + 1); return max(leftLength, rightLength); } else { int leftLength = consecutive(n.left, n.value, 1); int rightLength = consecutive(n.right, n.value, 1); return max(leftLength, rightLength, length); } } public int max(int... vals) { int max = Integer.MIN_VALUE; for (int x : vals) { if (x > max) max = x; } return max; } |

Did you get the right answer to this coding interview question? Please share your thoughts in the comments below.