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

  Рет қаралды 66,888

Anuj Kumar Sharma

Anuj Kumar Sharma

Күн бұрын

Пікірлер: 66
@subhankarpal2800
@subhankarpal2800 2 жыл бұрын
Now I can say my Nonlinear Data structure journey has been started with Anuj Bhaiya 🙏🙏🙏🙏🙏 Thank You Sir ❣❣❣❣.
@abdullahirfan3078
@abdullahirfan3078 2 жыл бұрын
Never knew that this medium level topic is going to be so easy for me Thank yoy
@Jitendrachouhan1999
@Jitendrachouhan1999 2 жыл бұрын
You are Such as Good Mentor 🥰 i really inspired your video when did I watch ❤
@RepublicDay2023
@RepublicDay2023 2 жыл бұрын
You are genious dude…!!! Applauses 👌👌👌
@raghunath4280
@raghunath4280 2 жыл бұрын
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....
@GhostRider.... 2 жыл бұрын
Bro please provide full solution
@yhlive8023
@yhlive8023 Жыл бұрын
You're right i been thinking the same bro , use min max and hashmap
@grossHumiliation
@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
@jerrykodes 9 ай бұрын
Nice one!
@udaychandu3925
@udaychandu3925 2 жыл бұрын
Very Clean and Neat Explaination,Sir!
@amanrathour3176
@amanrathour3176 2 жыл бұрын
So easily explained 😍. Thanku.
@MindsetMotivation75
@MindsetMotivation75 2 жыл бұрын
Thank you bhaiya , best explanation ever.
@ANJALIGUPTA-vq1cv
@ANJALIGUPTA-vq1cv 2 жыл бұрын
awesome bhaiya, thanks for making coding easier
@prannoyroy5312
@prannoyroy5312 2 жыл бұрын
Thanks Anuj! Great job bro! 👌
@Ladder2Corporate
@Ladder2Corporate 9 ай бұрын
, vertical order, top view, bottom view, what an explanation ☺☺☺
@shreysom2060
@shreysom2060 2 жыл бұрын
Great explaination
@xerOnn35
@xerOnn35 2 жыл бұрын
Thanks Sir !
@anandjaiswal6588
@anandjaiswal6588 2 жыл бұрын
Maaza aa gaya 😁
@saritaprasad4295
@saritaprasad4295 2 жыл бұрын
amazing with most difficult topic
@GhostRider....
@GhostRider.... 2 жыл бұрын
Nice explanation bhaiya
@Rorschach_ind
@Rorschach_ind 2 жыл бұрын
This video was helpful!
@militaryink319
@militaryink319 2 жыл бұрын
Thanks bhya . I am following you
@jeeveshsinghroa3218
@jeeveshsinghroa3218 Жыл бұрын
Good Solution!
@lokendrasingh9780
@lokendrasingh9780 2 жыл бұрын
Thank You Bhaiya🙏👌
@harshvardhansingh780
@harshvardhansingh780 2 жыл бұрын
Thank you so much bhaiya mai yhi same glti kar rha tha.... thank you
@pinkkitty6553
@pinkkitty6553 Жыл бұрын
Thank you bhaiya
@prateekchauhan5376
@prateekchauhan5376 2 жыл бұрын
loveddddd it
@hangover2.0
@hangover2.0 10 ай бұрын
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
@tech_wizard9315 2 жыл бұрын
Can you please provide a 60roamdap of important topics for DSA beginner to crack tech giant's like Microsoft linkedin etc
@AnujBhaiya
@AnujBhaiya 2 жыл бұрын
This is next in line.. will be coming out soon 😄 stay tuned
@ShivamVerma-gq2sm
@ShivamVerma-gq2sm 2 жыл бұрын
wonderful
@anuj_abh
@anuj_abh 2 жыл бұрын
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
@King-xs4tq 2 жыл бұрын
Malum pada bhai
@anuj_abh
@anuj_abh 2 жыл бұрын
@@King-xs4tq ni bhai, agr pta chale to btana
@King-xs4tq
@King-xs4tq 2 жыл бұрын
@@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
@ImranKhan-mc6vf
@ImranKhan-mc6vf 2 жыл бұрын
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
@kumarrohit8311 2 жыл бұрын
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
@pulkitchausali1354 2 жыл бұрын
Output will like -> 5, 6, 8, 2, 2
@harishlodha8794
@harishlodha8794 2 жыл бұрын
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
@sumitchakraborty9451
@sumitchakraborty9451 2 жыл бұрын
what is the time complexity of this solution
@kanaramjangid8563
@kanaramjangid8563 6 ай бұрын
❤❤❤
@shivamchaurasiya2004
@shivamchaurasiya2004 2 жыл бұрын
Bhaiyaa DevOps par ek video banaiye isme career kaise banaye
@akashmishra3369
@akashmishra3369 2 жыл бұрын
Bhaiya, TreeMap nahi use karke, Map ko sort kardein end me to kaam nahi banega ? :( (Not sure how to implement Treemap in javascript)
@AnujBhaiya
@AnujBhaiya 2 жыл бұрын
Ho jaega usse bhi
@mohakarora8712
@mohakarora8712 10 ай бұрын
can somebody tell me why are we using level order only?
@mastimazawithnature6749
@mastimazawithnature6749 2 жыл бұрын
Is dsa course me kya sikhne ko milega
@AnujBhaiya
@AnujBhaiya 2 жыл бұрын
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
@shaileshtiwari9570 Жыл бұрын
why we don't take preorder traversal for bottom view , kindly give a tree example where preorder traversal gives wrong answer.
@wizardiors
@wizardiors 2 жыл бұрын
did u have a computer science degree??
@worldpuzzle1031
@worldpuzzle1031 2 жыл бұрын
❤️❤️
@YashTalks_YT
@YashTalks_YT 2 жыл бұрын
many teachers can't even accept their mistakes
@madetolaugh3476
@madetolaugh3476 2 жыл бұрын
Largest BST
@harshit4190
@harshit4190 2 жыл бұрын
time complexity?
@antibarcelona2123
@antibarcelona2123 2 жыл бұрын
O(no. of nodes i guess)
@rahulji882
@rahulji882 2 жыл бұрын
22nd link
@mastimazawithnature6749
@mastimazawithnature6749 2 жыл бұрын
Binary code kya hota hai Kya isse me kya kr sakta hu
@harsh_choudhary5940
@harsh_choudhary5940 2 жыл бұрын
@Kumar Chitransh abe😂😂
@yhlive8023
@yhlive8023 Жыл бұрын
​@Kumar Chitransh 😂
@lakhanshanker6105
@lakhanshanker6105 2 жыл бұрын
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
@pratikvishwakarma1599 2 жыл бұрын
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
@lakhanshanker6105 2 жыл бұрын
@@pratikvishwakarma1599 bhai wo to thek h pr sare test cases pass nhi ho rhe
@RajatGupta-lq3cb
@RajatGupta-lq3cb 2 жыл бұрын
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
@yhlive8023 Жыл бұрын
It will be complicated bro but it's your choice how you want to do 😊
@manojkhan5639
@manojkhan5639 Жыл бұрын
Thanks bhiya
@mma-dost
@mma-dost 6 ай бұрын
Thanks bhaiya
L28. Maximum Width of Binary Tree | C++ | Java
22:41
take U forward
Рет қаралды 290 М.
JISOO - ‘꽃(FLOWER)’ M/V
3:05
BLACKPINK
Рет қаралды 137 МЛН
L23. Bottom View of Binary Tree | C++ | Java
13:13
take U forward
Рет қаралды 205 М.
L22. Top View of Binary Tree | C++ | Java
10:30
take U forward
Рет қаралды 280 М.