Top view of Binary Tree | Bottom view of Binary Tree | Binary Tree Data Structures Java | DSAOne #61

[@subhankarpal2800]

Now I can say my Nonlinear Data structure journey has been started with Anuj Bhaiya 🙏🙏🙏🙏🙏 Thank You Sir ❣❣❣❣.

[@raghunath4280]

Nice solution. But i found out a little bit optimization for the above solution. Consider d= horizontal diameter of the tree. Building Treemap takes o(dlogd). Instead of TreeMap use HashMap and maintain two static variables i.e., min and max and update the min and max values as min=Math.min(min,temp.hd); max=Math.max(max,temp.hd); for every iteration. Now traverse the HM from min to max and add those values to a new ArrayList. This will reduce the time complexity from O(n+dlogd) to O(n)

[@GhostRider....]

Bro please provide full solution

[@yhlive8023]

You're right i been thinking the same bro , use min max and hashmap

[@grossHumiliation]

bro this is correct? void topView(Node *root, int x, map &m) { if (root == NULL) return; if (m.find(x) == m.end()) { m.insert(make_pair(x, root->data)); } topView(root->left, x - 1, m); topView(root->right, x + 1, m); }

[@jerrykodes]

Nice one!

[@abdullahirfan3078]

Never knew that this medium level topic is going to be so easy for me Thank yoy

[@Jitendrachouhan1999]

You are Such as Good Mentor 🥰 i really inspired your video when did I watch ❤

[@Ladder2Corporate]

, vertical order, top view, bottom view, what an explanation ☺☺☺

[@RepublicDay2023]

You are genious dude…!!! Applauses 👌👌👌

[@udaychandu3925]

Very Clean and Neat Explaination,Sir!

[@ANJALIGUPTA-vq1cv]

awesome bhaiya, thanks for making coding easier

[@MindsetMotivation75]

Thank you bhaiya , best explanation ever.

[@amanrathour3176]

So easily explained 😍. Thanku.

[@shreysom2060]

Great explaination

[@anandjaiswal6588]

Maaza aa gaya 😁

[@GhostRider....]

Nice explanation bhaiya

[@saritaprasad4295]

amazing with most difficult topic

[@xerOnn35]

Thanks Sir !

[@harshvardhansingh780]

Thank you so much bhaiya mai yhi same glti kar rha tha.... thank you

[@prannoyroy5312]

Thanks Anuj! Great job bro! 👌

[@pinkkitty6553]

Thank you bhaiya

[@jeeveshsinghroa3218]

Good Solution!

[@militaryink319]

Thanks bhya . I am following you

[@Rorschach_ind]

This video was helpful!

[@lokendrasingh9780]

Thank You Bhaiya🙏👌

[@hangover2.0]

for implementing the queue method we can define three variables in class third one to store level and in the if condition we will check using or operator that if the level of incoming node is lesser than the already existing node it will replace the node. Please tell me if something is wrong with this approach . Open to other suggestions.

[@tech_wizard9315]

Can you please provide a 60roamdap of important topics for DSA beginner to crack tech giant's like Microsoft linkedin etc

[@AnujBhaiya]

This is next in line.. will be coming out soon 😄 stay tuned

[@prateekchauhan5376]

loveddddd it

[@ShivamVerma-gq2sm]

wonderful

[@anuj_abh]

Few days ago, bhaiya you suggested a youtube channel for learning java from scratch (u told, u also learnt from there) please give that channel link again, I forget that channel name. 🙏🏻

[@King-xs4tq]

Malum pada bhai

[@anuj_abh]

@@King-xs4tq ni bhai, agr pta chale to btana

[@King-xs4tq]

@@anuj_abh Nahi bhai maine to bhaiya ke course se hi pada tha java lekin beginners ke liye utna fayde ka nahi h. Agar aapko malum padey to bataiyega

[@shivamchaurasiya2004]

Bhaiyaa DevOps par ek video banaiye isme career kaise banaye

[@YashTalks_YT]

many teachers can't even accept their mistakes

[@madetolaugh3476]

Largest BST

[@sumitchakraborty9451]

what is the time complexity of this solution

[@ImranKhan-mc6vf]

Not sure if it is the correct logic for bottom view. Consider this example. 7(0) / \ 6 (-1) 2 (1) / \ / \ 5 ( -2 ) 1(0) 8(0) 2 (2) We have 2 0s at bottom, but the map would hold just 1 zero. So your logic would give -> 5, 8, 2 instead of 5,1,8,2. Or am I missing something?

[@kumarrohit8311]

See the video at 1:07. He talks about when two elements with same distance are met, we pick the right side one. Hence, 8 is picked up!

[@pulkitchausali1354]

Output will like -> 5, 6, 8, 2, 2

[@kanaramjangid8563]

❤❤❤

[@mohakarora8712]

can somebody tell me why are we using level order only?

[@rahulji882]

22nd link

[@wizardiors]

did u have a computer science degree??

[@mastimazawithnature6749]

Is dsa course me kya sikhne ko milega

[@AnujBhaiya]

You'll learn almost anything there's to learn about Data Structures & Algorithms so that you can crack Top companies technical interviews easily. Many of you have already done it. Best of Luck 🤗

[@shaileshtiwari9570]

why we don't take preorder traversal for bottom view , kindly give a tree example where preorder traversal gives wrong answer.

[@worldpuzzle1031]

❤️❤️

[@harishlodha8794]

Sir background video recorder app se user Jo video record karta hai kya vo video app Wale ke pass bhi store hota hai kya Kya ye possible hai ki Jo video hum record karte hain vo app Wale ke pass bhi store hota hai kya

[@akashmishra3369]

Bhaiya, TreeMap nahi use karke, Map ko sort kardein end me to kaam nahi banega ? :( (Not sure how to implement Treemap in javascript)

[@AnujBhaiya]

Ho jaega usse bhi

[@harshit4190]

time complexity?

[@antibarcelona2123]

O(no. of nodes i guess)

[@lakhanshanker6105]

static ArrayList topView(Node root) { Map map = new TreeMap(); int i=0; util(root,i,map); ArrayList ans = new ArrayList(); for(Map.Entry m : map.entrySet()){ int x = m.getValue(); ans.add(x); } public static void util(Node root, int i, Map map){ if(root==null) return; if(!map.containsKey(i)){ map.put(i,root.data); } util(root.left,i-1,map); util(root.right,i+1,map); } isme kya galti hai anyone ?

[@pratikvishwakarma1599]

ans.add(x); } } you need to close extra } , :P Otherwise check the video again on 04:05, where Anuj Bhaiya explains why normal traversal (preorder) will fail

[@lakhanshanker6105]

@@pratikvishwakarma1599 bhai wo to thek h pr sare test cases pass nhi ho rhe

[@mastimazawithnature6749]

Binary code kya hota hai Kya isse me kya kr sakta hu

[@harsh_choudhary5940]

@Kumar Chitransh abe😂😂

[@yhlive8023]

​@Kumar Chitransh 😂

[@RajatGupta-lq3cb]

Can someone help me. What if we solve it in this way using DFS? class Solution { static int min=0, max=0; static ArrayList topView(Node root) { ArrayList res=new ArrayList(); Map mp=new HashMap(); helper(root, mp, 0, 0); for(int i=min;i vd) { mp.put(hd, new Pair(root.data, vd)); } } else { mp.put(hd, new Pair(root.data, vd)); } helper(root.left, mp, hd-1, vd+1); helper(root.right, mp, hd+1, vd+1); } } class Pair { int val, vd;// vd represents vertical distance from root AKA depth. public Pair(int a, int b) { val=a; vd=b; } }

[@yhlive8023]

It will be complicated bro but it's your choice how you want to do 😊

[@manojkhan5639]

Thanks bhiya

[@mma-dost]

Thanks bhaiya