LeetCode 1372|Longest ZigZag Path in Binary Tree | DFS (Step-by-Step)

In this video, I have explained LeetCode 1372.
The goal is to find the longest ZigZag path in a binary tree.

In this video, I have used a DFS approach with direction tracking to compute the longest ZigZag path efficiently.

🧠 Concepts Covered
1. Binary Tree Traversal (DFS)
2. Recursion
3. Direction Tracking (Left ↔ Right)
4. Path Length Calculation
5. Global Maximum Update

⏱ Time Complexity: O(N)
📦 Space Complexity: O(H) (H = height of tree)

This is an important problem to understand how to manage states during recursion in tree problems.

🔗 Stay connected with me:
LinkedIn: https://www.linkedin.com/in/asmitamhetre3183/
LeetCode: https://leetcode.com/u/asmita3183/

👉 Don’t forget to like, share, and subscribe.
Your feedback means a lot! 🙌

#leetcode #leetcode1372 #dsa #datastructures #algorithms #coding #codinginterview
#programming #cpp #binarytree #trees #dfs #recursion #learncoding
#developerlife #softwareengineering #techcareer #placements #codingjourney #interviewprep

Видео LeetCode 1372|Longest ZigZag Path in Binary Tree | DFS (Step-by-Step) канала Asmita Mhetre

Комментарии отсутствуют

Информация о видео

2 апреля 2026 г. 21:01:05

00:14:20

Asmita Mhetre

Правообладателям

Жалоба на материал Недопустимый материал Нарушение авторских прав

Комментарии

Другие видео канала

LeetCode 1372|Longest ZigZag Path in Binary Tree | DFS (Step-by-Step)

443. String Compression (Part 2) #leetcode75 #leetcode #dsa #practice #interviewquestions

LeetCode 206 | Reverse Linked List | Vector, Stack, 3 Pointers & Recursion

LeetCode 1679 | Max Number of K-Sum Pairs | All Approaches + Code

LeetCode 2352 | Equal Row & Column Pairs | Simple Brute Force Solution

Total and Auxiliary Space Complexity and Time Complexity

LeetCode 199 | Binary Tree Right Side View | BFS Explained (Step-by-Step)

151. Reverse Words in a String (Part 2) #leetcode75 #leetcode #dsa #practice #interviewquestions

LeetCode 649 | Dota2 Senate | Queue Based Approach

LeetCode 547 | Number of Provinces | BFS Explained

LeetCode 2352 | Equal Row & Column Pairs | Optimized Trie (Prefix Tree) Solution in C++

LeetCode 392.Is Subsequence | Easy Explanation

334. Increasing Triplet Subsequence (Part 1) #leetcode75 #leetcode #dsa #practice

Remove BST Keys Outside Given Range | Recursion | Tree Modifications | GFG

LeetCode 3903 | Smallest Stable Index I | Weekly Contest 498 | O(N²) Approach

LeetCode 2095 | Delete the Middle Node of a Linked List | Slow & Fast Pointer Explained

LeetCode 1493 | Longest Subarray of 1’s After Deleting One Element | Sliding Window

LeetCode 1732 | Highest Altitude | Prefix Sum

LeetCode 2300 | Successful Pairs of Spells and Potions | Binary Search

LeetCode 236 | Lowest Common Ancestor of Binary Tree | DFS Explained (Step-by-Step)

LeetCode 1466 | Reorder Routes to City zero | BFS + Edge Trick

238. Product of Array Except Self (part 1) #leetcode75 #leetcode #dsa #practice #interviewquestions