Maximum Depth of Binary Tree - LeetCode 104 - Java

preview_player
Показать описание
In this video I will give you a detailed explanation to find the maximum depth of a binary tree in LeetCode using DFS (depth-first search) with recursion!

Video Contents:

00:00 - Read and understand the question
00:52 - Analogy to understand the recursion
03:20 - Explain the solution
08:06 - Code the solution
10:36 - Time and Space complexity
Рекомендации по теме
Комментарии
Автор

Fantastic explanation! I really liked the analogy!!

suggestaname
Автор

Good explaination. I do wish you had continued and completed all 75 questions.

lobofloyed
Автор

HI, great explanation. Can you do it using iterative method?. It will help to understand the DFS(using stack) as well.

Miscellaneous-Things
welcome to shbcf.ru