Print diagonal elements in binary tree(code/Algorithm/Program)

[@milimishra6447]

sir ..u r d only one i found till now who covered these topics of binary tree...thanks alottt...

[@RaviKumar-vk6ib]

You are an excellent teacher keep up the good work god bless you

[@momog7312]

This video is great! Nice explanation and clear algorithm! Thank you!

[@MrKumarrohan]

Thanks you so much sir for the best explanation ever for diagonal elements. Haven't found better explanation than this.

[@dharanyuvi6951]

Brother thanks for such a clear explanation.., kudos to you

[@ShabnamKhan-cj4zc]

Thanks a lot for simple explanation and visiting each every node to show logic.Thanks again.

[@niketkumar7777]

Bhai.. good approach..Till now i was doing it recursively and finding ways to do it iteratively.. great Man..

[@rishigoley3521]

BEST SOURCE TO LEARN ALGOS

[@theWrongInsights]

love you sir!!! kya smjhate ho tussi!!....

[@akashninave5001]

BEST EXPLAINATION, THANK YOU, SIR

[@vm1662]

You explain so well!!!!! Superb!! Thank you :)

[@hiteshusingh8571]

Nice explanation Sir

[@subhalakshmikumarappan8806]

Very clear and easily understandable..!!!

[@shristisingh6539]

very nice explanation..literally

[@rohansodha9555]

Excellent !

[@SahilJSawant]

At 22:34 don't you think the traversal should be "dij" instead of "dji" btw nice tutorial sir

[@ArpitDhamija]

yes it is !!

[@nakulamate3558]

what is the time complexity of the solution?

[@milimishra6447]

the way u teach is also very gud....

[@vivekanandkhyade]

Thanks Mili...!

[@MsSk8trboy]

Great explanation mahn ..... Keep it up

[@parmeziaaanoocheese2312]

great helped in a lot of interviews sir

[@AddieInGermany]

Sir you're THE best

[@hymnish_you]

Awesome yaar, keep doing!

[@LarryRuane]

Beautiful algorithm! I would not have thought of code this elegant. I'm just curious, did you think of this algorithm by yourself? Or is this a previously-known algorithm (that you have presented so clearly)?

[@shyammahato7178]

nice explanation.. thanku sir

[@Sushil2874]

Great explanation..!!

[@vaibhavkumar903]

kudos!! You made it look simple :)

[@prashantverma3347]

thank you

[@ShivangiSingh-wc3gk]

beautiful

[@prashantgiri1285]

Hey, Sir, I am following you for the past 1 year and your videos are very easy to understand and it gives me a lot of confidence to work on. I would ask for your help to create a placement series where we would get the 100 best questions discussion covering the entire topic of DS Algo and if that works on. We will be surely hitting big companies on campus for sure. ThankYou Prashant Giri Jadavpur University

[@travelogue4566]

nice explanation

[@siddharthsethia5986]

Good One sir!

[@piyushranjan3075]

Mind blowing algorithm

[@jatinbansal9347]

sir I think more easy way is to use map concept as you have used in vertical order traversal.

[@premprakash8220]

nice explanations

[@kumarparth444]

sir please upload more problems of binary tree

[@avikool1]

Great. Thanks!

[@SuyashSoni248]

Why do we need to explicitly specify a condition - If (p == null) break; The outer loop will anyway end as queue becomes empty at the last. Here is the implementation in Python - github.com/suyash248/ds_algo/blob/master/Tree/printDiagonals.py

[@coderajput1816]

where is its program

[@tsupreetsingh]

thanks bruh

[@naanchilnanban]

Yours video simply super. Can you please help me how to traversal a full binary tree in circular spiral (not in zigzag way).

[@gurupreetsingh8347]

sir , plz tim sorting pe details video bana ke samjyo do

[@ArpitDhamija]

its - d,i,j not d,j,i

[@somurauniyar2610]

sir thanks a lot ......

[@veerrajuyeleti8541]

sir could you upload on find the node in a binary tree having duplicate subtrees

[@vivekanandkhyade]

yes sure Veerraju.

[@vivekanandkhyade]

Hey VeerrRaju.....did u check the diagonal elements of a binary tree video.....u had asked for it....i m very happy to help u with that video.

[@veerrajuyeleti8541]

sir i checked it

[@harshgupta9761]

@@vivekanandkhyade sir diagonal traversal is not uploaded on your github account

[@nayankurude6369]

13:02 You missed out on marking u as 2.

[@nimishgupta5289]

u will be 3 not 2

[@srinidhiii]

thank you sir

[@vivekanandkhyade]

Thanks Srinidhi..!

[@saniltalauliker351]

With each algorithm you discuss, will you also please provide examples of best and worst time complexity for the same

[@kasa007]

Sir....I could be able to find this whole program on ur github account

[@amitkumarsingh5414]

void diagonalDistanc(Node * root, int d, map &v ){ if(!root) return; v[d].push_back(root->data); diagonalDistanc(root->left, d+1, v); diagonalDistanc(root->data,d,v); } Rest you can print it.

[@yilinyao1999]

讲的很好就是口音真的没字幕听不懂。

[@vedantdeshmukh1778]

如果没有翻译，您的评论会更加不全面。顺便问一下，你好吗？

[@abrahamwilliam1260]

By this method u can solve in O(N) and not itn O(n^2) public static void Diagonal(Node root, Map h){ LinkedList q= new LinkedList(); q.add(root); while(!q.isEmpty()){ // for(int i=0;i

[@igaming_]

Very difficult

[@brijpatel237]

thanks god :-P

[@vivekoberoi06]

Great explanation. Please avoid saying bad about other websites, it doesn't give out a good impression. People will give you the credit for the amazing videos anyway. Thanks from your well wisher