@payalsharma7925
Great videos. All algos explained in a lucid way. Please continue making and as many as you could. Thanks a lot.
@rajatagarwal60
awesome content!! :D
@SR-sn9up
Nice video. why do people think, you missed the case! (intentionally)
@svdfxd
Awesome video
@aayush9080
Nice video And good set of questions have been explained in the channel
@ashwinvarma9349
bhaiya, can you please code in c++ as well?
@ishaanarora326
Hi, Thanks for the video but your code misses an edge case, where say while printing the right boundary, if right node of the current node is not present. Then a recursive call to left node of current node will have to be made instead (given that we have checked that it is not a leaf node). The same logic applies while printing the left boundary.
@payalsharma6113
Seems the algo fails for this test case : 1 10 L 1 20 R 20 30 L 30 40 R
@yakshitbindal5468
It was a great video but it misses one edge case when we will be printing the right side, then what if there is no right node there. Then our case fails. To overcome this, we have to call the left child in the case when no right child is available in the traversal of the right part. Else the video was awesome.
@mayurkoli4145
what if there is right skewed binary tree to the right of 4.
@amanranjanverma
AAP to binary tree k pichhe pd gye hn, anyway nicely explained.
@sriramkumar6673
Boundary view Idea 1. Combine top view and bottom view . Idea 2 . Combine left view and right view Idea 3: print first and last elements of diagonal view are all these okay ??? Anyone Please reply !
@abhinavpandey3356
It's not working for. All cases
@mohanreddy4669
This code doesnt work for [1,2,3,4,5,6,null,null,null,7,8,9,10]
@tezzsingh88
Not correct
@gunjanagrawal6032