LeetCode Solution - 104 Maximum Depth Binary Tree | JavaScript DFS

preview_player
Показать описание
NOTE: I screwed up and wrote "BFS" when in fact its a DFS solution. I guess doing these videos late at night causes you to mix concepts. Please Replace the word BFS to DFS !!!

This question we introduce recursion and DFS . This is a detail solution to Maximum Depth of Binary Tree with explanation.
Рекомендации по теме
Комментарии
Автор

NOTE to everyone, i kind of messed up, as i filmed this late in the Evening. AS i coded i wrote BFS, but actually meant DFS. Just replace the word BFS to DFS as this is a Depth First Search Solution ... NOT a BFS.

ThinkFWD
Автор

I hope I get to work with an egineer like you at my first job...thank you for these videos and taking the time to explain them clearly

chips-n-salsa
Автор

You make great videos. Are you just starting? Because you feel like an experienced tutor.

waynewang
Автор

hey man did you ever fix the severe mosquito problem in your backyard?

NeptunesSounds