LeetCode 110. Balanced Binary Tree | Balanced Binary Tree LeetCode | Binary Tree

preview_player
Показать описание
📝Statement: Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as:

a binary tree in which the left and right subtrees of every node differ in height by no more than 1.

✅️BEST RESOURCES FOR SOFTWARE ENGINEERING PREP

✔️EQUIPMENT I USED IN THIS VIDEO:

✴️PRACTICE CODING QUESTIONS

❇️FREE RESOURCE ONLINE

⚡ Please leave a LIKE and SUBSCRIBE for more content! ⚡

⭐ Tags ⭐
- LeetCode
- 110. Balanced Binary Tree
- Balanced Binary Tree LeetCode

⭐ Hashtags ⭐
#leetcode

Disclosure: Some links are affiliate links to products. I may receive a small commission for purchases made through these links. #csninja
Рекомендации по теме
Комментарии
Автор

Good timing, I'm reviewing tree lol, thanks a lot

MiddleEasternInAmerica
Автор

This was so helpful, thank you! This video deserves so much more than 45 views

afridimajeed
Автор

This is great! One small point. The parameter n used for time complexity is defined as all the nodes in the Binary tree but for space complexity we would definitely not need to store all the n values in the call stack the same time, so I think in case of space complexity the parameter I believe stands for max height of the binary tree so it's better to use another variable to avoid confusion. Please feel free to correct me if I am wrong.

soumyodeepmukherjee
Автор

This was helpful indeed ! thanks for making it easy

RanjuRao