Iterative Postorder Traversal of a Binary Tree | Animation

Поделиться
HTML-код
  • Опубликовано: 17 ноя 2024

Комментарии • 46

  • @itsdineshvaryani
    @itsdineshvaryani  3 года назад +3

    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 - ruclips.net/p/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d

    • @kananmehdizade5171
      @kananmehdizade5171 2 года назад +1

      Thanks a lot for the clean explanation, it was a tough one, would it be possible to explain more BinaryTree examples from Leetcode?

    • @itsdineshvaryani
      @itsdineshvaryani  2 года назад

      @@kananmehdizade5171 sure

  • @shubhamagarwal1434
    @shubhamagarwal1434 2 года назад +3

    Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over RUclips with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)

  • @vipulberiwal
    @vipulberiwal Год назад

    Thanks for the great explanation and providing reasoning behind why we are doing that.

  • @KCTsangKen
    @KCTsangKen 2 года назад +2

    Thank you Sir, I really appreciate this video (and many other of your videos, too), and you step-by-step don't-rush approach is just great. Although I can understand the logic, my problem is that I often forget a couple of key pieces in the algorithms. The animation really helps me memorizing them. Haven't checked out all your videos yet but I hope you can make more animation videos on more advanced algorithms such as Kosaraju or Aho-Corasick, etc.

  • @mohnishpwr10
    @mohnishpwr10 2 года назад

    Good learning experience so far. DSA has always been mysterious and tough for me. Looks like I will be able to do something about dsa after watching these videos.

  • @kumudaranimahanta7634
    @kumudaranimahanta7634 3 года назад +4

    Great content. Thank you Sir

    • @itsdineshvaryani
      @itsdineshvaryani  3 года назад +1

      Welcome. I would request you to please share the course with your friends and colleagues. It would help the channel to grow and motivate me to add more videos.

  • @suseelkumarannamraju
    @suseelkumarannamraju 3 года назад +1

    Nice explanation sir. I learned how to traverse binary tree through your video series. Many thanks.

    • @itsdineshvaryani
      @itsdineshvaryani  3 года назад

      Welcome. I would request you to please share the course with your friends and colleagues. It would help the channel to grow and motivate me to add more videos.

    • @suseelkumarannamraju
      @suseelkumarannamraju 3 года назад +1

      @@itsdineshvaryani Yes sir. I have passed on to my colleagues

    • @itsdineshvaryani
      @itsdineshvaryani  3 года назад

      Thank you so much for the support !!!

  • @swaroopkanakam8684
    @swaroopkanakam8684 3 года назад +1

    🙏🙏 Great explanation
    Thank you sir for making this course for us

    • @itsdineshvaryani
      @itsdineshvaryani  3 года назад +1

      Welcome !!! Request you to please share it with ur friends and colleagues as well !!!

  • @duttamca
    @duttamca 2 года назад +1

    very nice explanations...your videos are superb...

  • @fardilviews
    @fardilviews 2 года назад +1

    thanks a lot ... Love from Bangladesh

  • @AhsanAli-vz6mg
    @AhsanAli-vz6mg 2 года назад

    Superb Explanation
    Thanks

  • @apsey2162
    @apsey2162 2 года назад +2

    understanding this logic was quite tough, was it a hard level problem and do we need to make such logics and code while in dsa???

  • @victorokpube5501
    @victorokpube5501 3 года назад +1

    thank so much for the explanation.what is the difference between pop and pull.and should the pull method be used in a stack instead of the pop.

    • @itsdineshvaryani
      @itsdineshvaryani  3 года назад

      Java stack usually has pop method ... use that !!!

  • @ascar66
    @ascar66 2 года назад

    Thank you sir! Great explanation

  • @AshishYadav-ey2vv
    @AshishYadav-ey2vv 6 месяцев назад +1

    sir how you come up with such a difficult algorithm . How your mind works? Our mind will never be able think that deep

  • @gokul4476
    @gokul4476 3 года назад +2

    Dinesh sir i think the programme time complexity is o(n^2) please reply sir

  • @rishabsud7535
    @rishabsud7535 Год назад

    can someone please explain about the time and space complexity of recursive vs iterative approach in this scenario? which one is better?

  • @mrunaligaikwad1953
    @mrunaligaikwad1953 3 года назад +2

    Why is pop() method not used here, i believe poll() is generally used with a queue

    • @itsdineshvaryani
      @itsdineshvaryani  3 года назад +2

      its actually pop method ... sorry for typo ... watch its next video for proper code

    • @tusharkhandave374
      @tusharkhandave374 Год назад

      @@itsdineshvaryani but using pop is giving empty stack exception

  • @ECE-xp5ws
    @ECE-xp5ws 3 года назад +1

    Thank you so much sir💖

  • @vaibhav9876
    @vaibhav9876 3 года назад +1

    Do we have to think such logics on our own??...as it seems quite tricky when i was trying to made the logic before watching the video

    • @itsdineshvaryani
      @itsdineshvaryani  3 года назад +1

      Yes ... You hv to practice and make such concepts !!!

  • @abhishekranjan1094
    @abhishekranjan1094 3 года назад +1

    Awesome sir 😋😋🤩

  • @harikrishnans2054
    @harikrishnans2054 Месяц назад

    bro confusing! plz make easy video! another video of post order is for members only