HackerRank - Height of a Binary Tree | Full solution with code and animations | Study Algorithms

preview_player
Показать описание
Finding the height of a binary tree is a very basic concept and it is used in a lot of preliminary analysis. You can approach this problem using a recursive technique or an iterative technique. One can also see the height of a tree as the deepest level in a binary tree. This video takes advantage of the level order traversal technique to find the height of a binary tree.

Chapters:
00:00 - Intro
00:54 - Problem statement and description
03:21 - Brute Force approach to find the height of a binary tree
06:14 - Efficient method
09:56 - Dry-run of Code
15:42 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

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

Really a underrated channel. Great explanation.Thank you sir

Ayush-ykzf
Автор

Yes true, very underrated channel! Come on Youtube!

bittujacob
Автор

Fantastic explanation, this deserves way more likes, thanks man! Your help while studying for interviews is invaluable, I hope great things happen for you and your family, keep up the good work!! 😀

bigjofa
join shbcf.ru