LeetCode Maximum Depth of a Binary Tree Solution Explained - Java

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


Preparing For Your Coding Interviews? Use These Resources
————————————————————

Other Social Media
----------------------------------------------

Show Support
------------------------------------------------------------------------------

#coding #programming #softwareengineering
Рекомендации по теме
Комментарии
Автор

sorry but that clap was really weak, I'm going to have to skip this video

MrsSlayer
Автор

yo Nick, for the bottom solution, we are not adding 1 each time right? its just adding 1 once at the end after the recursion is complete and the max(left_height, right_height) is determined.

ashishnayak
Автор

Bottom up definitely makes more sense.

tannerbarcelos
Автор

This is question 104 btw for everyone wondering

lukenick
Автор

i wonder what is the number of this question?

jiang-eksv