Balanced Binary Tree - Leetcode 110 - Java

preview_player
Показать описание
Balanced Binary Tree - Leetcode 110 - Java

--------------------------------ABOUT--------------------------------
🧑🏻 My name is David and I am a software engineer at Meta. My passion is teaching software devs how to pass the grueling technical interviews to help them land their 6-figure dream tech job.

I have received 3 six-figure offers from Google, Meta, and Amazon.

🔬I provide content that will allow you to understand the thought process, pseudocode, time complexity, and code when approaching coding problems.

--------------------------------SOCIAL--------------------------------

💬 If you have any topic or questions you want me to cover, let me know in the comment section below ~ ฅʕ•ᴥ•`ʔ ฅʕ•ᴥ•`ʔ ฅʕ•ᴥ•`ʔ

#technicalinterview #techcareer #softwareengineer
Рекомендации по теме
Комментарии
Автор

The final line: `Math.max(left, right) + 1;` confuses me a bit. My gut instinct is to want to keep the left and right subtrees separate for evaluation, instead of combining them here. Could you help clarify that for me?

NathanSass