Nodes having 'K' leaves in its SubTree Algorithm

Find nodes having K leaves in its SubTree.

[@dhruv2014]

Nice video 🔥

[@shrijanaryal4923]

what if the tree is null ? i think you have to check if thats the case first and return 0 if thats true.

[@ankan1994]

sir, can this code be optimized as if a node which is a subtree of a tree has already total leaf count>k, then the root means the node at its upper level also have k>2..no need to check it through recursion....for eg- if node c has k>2 which is subtree of a,then its obvious that its root a has k>2...so whats the point to check it?

[@bhupalibaishya2136]

sir string permutation backtracking pe video banayiye na

[@shrijanaryal4923]

kzbin.info/www/bejne/bWnXkKx-qqyaY5I watch this! You will never forget how its done once you watch this video.

[@ankitlohiya76]

this vdeo is super awesome....

[@vivekanandkhyade]

Thanks Ankit.!

[@barahah9871]

can u be bit faster ........u r like a cammel

[@srinidhiii]

If u want you adjust the speed of you video. He is explaining very well indeed!!