Longest Zig Zag Path In Binary Tree | Leetcode 1372. Longest ZigZag Path in a Binary Tree

Показать описание

Рекомендации по теме

Комментарии

Most Easy slution

Note: just keep track to which direction you are returning. if returning to left then return right + 1 else left + 1

working code:

int helper(TreeNode* root, int& res, char dir) {

if (root == NULL) return 0;

int left = helper(root->left, res, 'L');
int right = helper(root->right, res, 'R');

res = max(res, max(left, right) + 1);
if (dir == 'L') return right + 1;
else return left + 1;
}
int longestZigZag(TreeNode* root) {
int res = 0;
char ch ='$';
helper(root, res, ch);
return res - 1;
}

mohdmudassir

code in c++
class Solution {
public:
int longestPath;

int dfs(TreeNode *root, bool isLeft, bool isRight)
{
if (!root)
return 0;

int leftVal = dfs(root->left, true, false);
int rightVal = dfs(root->right, false, true);

longestPath = max({longestPath, leftVal, rightVal});

if (isLeft)
return rightVal + 1;
return leftVal + 1;
}
int longestZigZag(TreeNode *root)
{
longestPath = 0;
dfs(root, false, false);
return longestPath;
}
};

wecan

This is cool : forward = 7 and backward = 6 .

jayshakti

Nice explanation sir....thanks for the video.

paragroy

Sir ek dry run end mein kardete toh kaafi clarity aajati.

AmanpreetsetiaRA

sir vaise concept toh samaj aagaya or faith wala sa kara toh sab badiya ha

par agar iska dry run karta hu toh dimag dard ho jaata ha ..

letsdoeverythinginoneweek

Sir web dev ka course kb continue hoga
Please sir continue kariye

vipinkumarmaurya

Can anyone please explain why we have not initialized maxLen by 0 not -1 like forward Slop and backwardSlop????

shivangsingh

Sir. Majority in an arary bhi kara dena please

coders

Pair name for class is misleading as its not a pair as such it holds 3 values

narendrakothamire

class Solution {
public:
// int finalans;
pair<int, int>res(TreeNode *r, int &finalans)
{
if(!r)
return {-1, -1};

pair<int, int>a=res(r->left, finalans);

pair<int, int>b=res(r->right, finalans);

pair<int, int>ans;
ans.first=1+a.second;

ans.second=1+b.first;

finalans=max(finalans, 1+(a.second, b.first));
// cout<<anst<<" ";

return ans;
}

int longestZigZag(TreeNode* root) {

int finalans=0;
res(root, finalans);
return finalans;

}
sir could you please check why this is giving wrong answer?

learner_

Longest Zig Zag Path In Binary Tree | Leetcode 1372. Longest ZigZag Path in a Binary Tree

Longest ZigZag Path in a Binary Tree - LeetCode 1372 - Python Solution

Longest ZigZag Path in a Binary Tree - Python #leetcode #leetcode75

Longest ZigZag Path in a Binary Tree - LeetCode #1372 - Python, JavaScript, Java and C++

Longest ZigZag Path in a Binary Tree - | Leetcode-1372 | MICROSOFT | Explanation + Live Code

Longest ZigZag Path in a Binary Tree || Binary Tree || DFS || Leetcode 1372 || C++/Java/Python

LeetCode 1372 - Longest ZigZag Path in a Binary Tree - Python

L19. Zig-Zag or Spiral Traversal in Binary Tree | C++ | Java

Longest ZigZag Path in a Binary Tree - Leetcode 1372 - Python

1372. Longest ZigZag Path in a Binary Tree | LeetCode Daily Challenge | LeetCode POTD

Leetcode Longest Zig Zag Path in a Binary Tree - Solution Explained

1372 Longest ZigZag Path in a Binary Tree

DAY 48 | 1372. Longest ZigZag Path in a Binary Tree | LeetCode 1372 | JAVA

Leetcode 1372. Longest ZigZag Path in a Binary Tree finally AC

1372. Longest Zig Zag Path in a Binary Tree (Explained & Solved using Python)

1372. Longest ZigZag Path in a Binary Tree - Day 19/30 Leetcode April Challenge

1372. Longest ZigZag Path in a Binary Tree

Solving the '1372. Longest ZigZag Path in a Binary Tree' Problem in Java LeetCode 75 Study...

1372 Longest ZigZag Path in a Binary Tree Solution 1

LeetCode 75 - 1372 Longest Zig Zag Path in a Binary Tree Made with Clipchamp

Longest ZigZag Path in a Binary Tree (LeetCode)

How To Survive Tied To Train Tracks 😱

Crack Binary Tree Challenges 1372. Longest ZigZag Path in a Binary Tree LeetCode | Live Coding

Leetcode 1372. Longest ZigZag Path in a Binary Tree

🚀 #LongestZigZagPath in a #BinaryTree | #LeetCode75 🔥 | #DFS #Recursion #Python #TreeTraversal