Question / Problem: <a target="_blank" href="https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/">Leetcode</a>
Solution
<pre><code class="lang-java">class Solution {
 int find(TreeNode root, int isLeft, int count){
 if(root == null) return count;
 if(isLeft == 1) 
 return Math.max(find(root.right,0,count+1), find(root.left,1,0));
 return Math.max(find(root.left,1,count+1), find(root.right,0,0));
 }
 public int longestZigZag(TreeNode root) {
 return Math.max(find(root.left,1,0), find(root.right,0,0));
 }
}
</code></pre>
Algorithm
<ol>
<li>Current is left, and going to right then increment by 1 else reset to 0, Wiseversa
</li>
<li>DP till to find the max between left and right possibility
</li>
<li>return the Maximum integer
</li>
</ol>
Readers
If you feel this is helpful, please do leave a Like / Comment. If you feel I can improve better, please leave comments where I can improve. Any suggestions are help

Question / Problem: [Leetcode](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/)

**Solution**

```java
class Solution {
    int find(TreeNode root, int isLeft, int count){
        if(root == null) return count;
        if(isLeft == 1) 
            return Math.max(find(root.right,0,count+1), find(root.left,1,0));
        return Math.max(find(root.left,1,count+1), find(root.right,0,0));
    }
    public int longestZigZag(TreeNode root) {
        return Math.max(find(root.left,1,0), find(root.right,0,0));
    }
}
```

**Algorithm**

1. Current is left, and going to right then increment by 1 else reset to 0, Wiseversa
    
2. DP till to find the max between left and right possibility
    
3. return the Maximum integer
    

**Readers**

If you feel this is helpful, please do leave a Like / Comment. If you feel I can improve better, please leave comments where I can improve. Any suggestions are help

Leetcode - 1372. Longest ZigZag Path in a Binary Tree