Count Complete Tree Nodes | Leetcode 222 | Live coding session 🔥🔥🔥

preview_player
Показать описание
Here is the solution to "Count Complete Tree Nodes" leetcode question. Hope you have a great time going through it.

1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough using Priority Queue
3) 9:00 Coding

For discussion/feedback

PS : Please increase the speed to 1.25X
Рекомендации по теме
Комментарии
Автор

The solution link in description is for previous problem

shantanusingh
Автор

With Trees recursion is the one to think most of the times. Thanks for the approach :)

Coolharshit
Автор

Very good explanation always height of the complete binary tree is logn

praveenj
Автор

nice explanation! please don't stop this series...this is very helpful👏👏

prateekjoshi
Автор

i was missing left==null check while returning..Thanks brother.

ashishkalra
join shbcf.ru