Please *Like* , *Comment* , *Share* , *Subscribe* and *Click Bell* 🔔🔔🔔 Icon for More Updates. To get *Data Structures and Algorithms* complete course for free please follow this link - kzbin.info/aero/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d
@shubhamagarwal14342 жыл бұрын
Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over KZbin with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)
@itsdineshvaryani2 жыл бұрын
Thanks !!!
@shubhamagarwal14346 ай бұрын
Your playlist is like energy drink, i need before my DSA interviews...helped me changeing job last year and i am sure will help me this year as well...thanks a lot bro for this wonderful playlist....👍👍
@itsdineshvaryani6 ай бұрын
Welcome
@shabnamjarial13027 ай бұрын
Thanks a lot. The patients and efforts can be seen in the video. Great way of explaining!
@itsdineshvaryani7 ай бұрын
Glad you liked the videos !!!
@swapniltravels2 жыл бұрын
not seen such a crystal clear explanation.☺
@itsdineshvaryani2 жыл бұрын
Thanks !!!
@Kumarvivek-uv5hf3 жыл бұрын
Very well explained. Really appreciate your teaching skills.
@itsdineshvaryani3 жыл бұрын
Thanks !!!!
@barathkumar8733 жыл бұрын
Thanks u so much for crystal clear explanation 👍👌
@itsdineshvaryani3 жыл бұрын
Welcome !!
@TheSKooler2 жыл бұрын
Sir I follow you a lot and I think I grasped most of the concepts by watching your content, One humble request to you is that Start dynammic programming content and I am sure that you will get lakhs of views
@itsdineshvaryani2 жыл бұрын
Sure !!!
@TheSKooler2 жыл бұрын
@@itsdineshvaryani if you have any paid content of dynamic programming please let me know specifically for competitive programming
@itsdineshvaryani2 жыл бұрын
@@TheSKooler will add ... Currently i dont have !!!
@orusuvenkatesh9090 Жыл бұрын
Great tutorial for DSA in Java
@itsdineshvaryani Жыл бұрын
Glad you liked it
@randipmalakar5542 жыл бұрын
Your videos are excellent source for new learners ! For this iterative Preorder traversal its using Stack DS. I see in some cases where Queue DS is used in Binary Tree traversal. I couldn't figure out when Stack is to be used and when Queue is to be used in Binary Tree. Do you have any video which is using Queue/Dqueue DS instead of Stack DS ? I want to understand the implementation using Queue/Dqueue DS. Thanks again for your excellent videos !
@itsdineshvaryani2 жыл бұрын
Its there !!! In bfs we use queue and in dfs we use stack
@randipmalakar5542 жыл бұрын
Thanks for your answer !
@rishabsud7535 Жыл бұрын
what is the fundamental difference between recursive and iterative? Like, does iterative take lesser time? Can you explain?
@ascar662 жыл бұрын
Thank you sir! Awesome algorithms.
@itsdineshvaryani7 ай бұрын
Welcome
@rahulrsavant2 жыл бұрын
Those who can see invisible, can do impossible 👍👍👍👍👍
@DSCS_AkshataChavan4 жыл бұрын
Thank you so much sir for ur effort 🙏
@itsdineshvaryani4 жыл бұрын
It's my pleasure
@kasicoodes87302 жыл бұрын
Thanks bro your content is clean an easy to understand nice 1 :)
@itsdineshvaryani2 жыл бұрын
welcome !!!
@nitinmaheshwari92727 жыл бұрын
Thank you for uploading, very helpful!!!
@itsdineshvaryani7 жыл бұрын
Nitin Maheshwari Welcome !!!
@sanjayjitu14 жыл бұрын
Bro , please upload the post order , inorder iterative traversal.
@itsdineshvaryani4 жыл бұрын
Already uploaded
@janimiyashaik14114 жыл бұрын
Excellent 🤜bro
@itsdineshvaryani4 жыл бұрын
Thank you! Cheers!
@ranjankashyap18663 жыл бұрын
Sir dont we have to pass the TreeNode root into the method??
@itsdineshvaryani3 жыл бұрын
???
@_SeaH0rse Жыл бұрын
if you understand the way stacks work, the way he explains it is clear enough. The root node is passed into the stack, but with the LIFO principle, the procedure shows how they are processed (iteratively)
@abhishekranjan10943 жыл бұрын
very nice Sir 😊😊
@srikanthracharla4204 жыл бұрын
Can you please tell me, Which one is recommended to use? Recursive Version OR Iterator Version? Please give Replay to me, Thank you
@itsdineshvaryani4 жыл бұрын
Recursion has simple code while performing tree traversals ... Both has same time and space complexities ... But its preferred to use iterative ... Bcoz it avoids stack to get overflow ...
@srikanthracharla4204 жыл бұрын
@@itsdineshvaryani humm ok, thank you so much for your reply 🧡
@pratyushranjansahu94956 жыл бұрын
unable to download the source code..can u plz suggest how to download.
@itsdineshvaryani3 жыл бұрын
The source code github link has been added in description of video. Please check !!!
@ekansh6267 Жыл бұрын
👌👌👍
@nicoqueijo4 жыл бұрын
Would doing this with a queue instead give you post-order traversal?
@itsdineshvaryani4 жыл бұрын
I dont think so ...
@santhoshimalay25583 жыл бұрын
thank you so much
@itsdineshvaryani3 жыл бұрын
Welcome !!!
@santhoshimalay25583 жыл бұрын
@@itsdineshvaryani please upload videos on what topics to be prepared for a beginner google,amazon,microsoft internships.Thanks in advance your explanation is awesome
@itsdineshvaryani3 жыл бұрын
@@santhoshimalay2558 Am trying to post more and more. Hopefully will try to cover more interview questions as well !!!
@santhoshimalay25583 жыл бұрын
@@itsdineshvaryani thanks a lot sir, Can you please suggest me the topics to be go through perfectly for the internships? please, I am trying so hard to get