LeetCode 104. Maximum Depth of Binary Tree - Interview Prep Ep 65

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

⭐ Support my channel and connect with me:

Solutions explained:
Recursive solution: We'll add one to each level before traversing to its left and right children, return zero when the current node is null.

Iterative solution: We can use two extra data structures to help us mimic what happens when the recursive program runs, one is the stack that holds the tree nodes that we'll iterate on, the other is the depths of each of the node.

// TOOLS THAT I USE:

// MY FAVORITE BOOKS:

My ENTIRE Programming Equipment and Computer Science Bookshelf:

And make sure you subscribe to my channel!

Your comments/thoughts/questions/advice will be greatly appreciated!

#softwareengineering #leetcode #algorithms #coding #interview #SDE #SWE #SiliconValley #programming #datastructures

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

Комментарии

Actually this is the best explanation you can find on youtube....Others just focused on writing the code.Thanks man!

slycreator

Thanks for explaining this so well. I feel like a lot of coding youtubers don't break down a problem into it's visual side which is so important for learning how something works!

TejaswiniManjunatha

Thank you, I was looking for exactly this type of diagrammatic explanation! Thank you so much!!!

yixuanniu

This was the best explanation I could find of this problem, I appreciate you drawing out the recursive calls.

cameronhoward

Level up! My algorithmic intelligence has been increased by 3.

mcreyfonacier

Excellent explanation. Thank you! Keep up the good work!

Patiencelad

That was the best explanation I've ever seen. Thank you very much!

adithyagowda

Thanks for such a detailed explanation, quite informative video.Please also explain code using C++.Please

ChandraShekhar-bycd

hey, thanks for the great explanation and effort Fisher. I hope you could possibly show a visual explanation for the iterative step as well for those who are not familiar with the LinkedList data structure. Thank you!

ILoveChocx

I finally understood recursion, thanks buddy

rakshith

Excellent explanation. Much appreciated!

tuozhang

that's a great explanation. Thanks !!

kaanhanokyay

you are amazing man, love your videos

qahoushh

Hey, I'm having trouble
I wrote the following code but not sure why it returns the wrong answer

public int maxDepth(TreeNode root)
{
if(root==null) return 0;

if(root.left!=null) lh = maxDepth(root.left);
if(root.right!=null) rh = maxDepth(root.right);

return 1+Math.max(lh, rh);

}

lakshaygupta

pretty good. BTW, I guess you can speak mandarin, right?

zhenliu

int maxDepth(TreeNode* root) {
int maxDepth = 0; // Initialize the maximum depth
int count = 0; // Initialize the current depth counter
dfs(root, count, maxDepth);
return maxDepth;
}

private:
void dfs(TreeNode* node, int count, int &maxDepth) {
if (node == NULL) return;
count++; // Increment counter to reflect current depth
if (count > maxDepth) {
maxDepth = count; // Update maximum depth
}
dfs(node->left, count, maxDepth);
dfs(node->right, count, maxDepth);
}
}; brother this code works but i cant understand how every recursion call maintain its own count variable

hydrocy.

LeetCode 104. Maximum Depth of Binary Tree - Interview Prep Ep 65

Maximum Depth of Binary Tree - 3 Solutions - Leetcode 104 - Python

LeetCode 104. Maximum Depth of Binary Tree - Interview Prep Ep 65

Leetcode 104 - Maximum Depth Of Binary Tree (Height)

Maximum Depth of Binary Tree - LeetCode 104 - Java

Maximum Depth of Binary Tree - Leetcode 104 - Trees (Python)

LeetCode 104: Maximum Depth of Binary Tree [Python]

104. Maximum Depth of Binary Tree. Решаем Leetcode на Python под бодрый фонк

Maximum Depth of Binary Tree (LeetCode 104) | Full Solution with animations | Study Algorithms

Adobe Coding Interview Question - Max Depth of Binary Tree (Height) - Leetcode 104

LeetCode Maximum Depth of a Binary Tree Solution Explained - Java

Python Programming Practice: LeetCode #104 -- Maximum Depth of Binary Tree

Maximum Depth of Binary Tree | Leetcode - 104

Easy Coding Interview Question! | Maximum Depth of Binary Tree - Leetcode 104

Leetcode 104: Maximum Depth of Binary Tree

104. Maximum Depth of Binary Tree - Day 1/31 Leetcode December Challenge

Leetcode 104 - Maximum Depth Of Binary Tree (JAVA Solution Explained!)

104. Maximum Depth of Binary Tree Java Solution

Maximum Depth of Binary Tree - LeetCode 104 (Depth First Search)

Leetcode 104. Maximum Depth of Binary Tree

How To Solve '104 Maximum Depth of Binary Tree' on LeetCode - JavaScript Easy

Software Engineer/Developer Interview Question: 104. Maximum Depth of Binary Tree

LeetCode #104 - Maximum Depth of Binary Tree

leetcode 104 Maximum Depth of Binary Tree

LeetCode #104: Maximum Depth of Binary Tree | Recursive DFS