Depth-First Search/Traversal (DFS) in Binary Tree

แชร์
ฝัง
  • เผยแพร่เมื่อ 16 ม.ค. 2025

ความคิดเห็น • 3

  • @Me-kt3gh
    @Me-kt3gh 15 วันที่ผ่านมา

    Very nice explanation. Helped me a lot. Though I wanted to point out a couple issues on the website article.
    - Steps 3 and 4 to the approach are the same.
    - Step 5 has a typo ("id" should be "is")
    - When running the code, it shows "Error" above the output, even though it is running just fine. I tested the code with a simple print statement and the output works but it still says "Error".

    • @tutorialhorizon9085
      @tutorialhorizon9085  15 วันที่ผ่านมา +1

      Hey, I am Glad that you have found it helpful.
      Thanks for pointing out the issues on the website, we have fixed the steps in the article. Will fix the IDE issue soon, in place of Error I suppose to show the time taken by the code. Output of the code is still showing and correct.
      Thanks Again.
      Tutorial Horizon

    • @Me-kt3gh
      @Me-kt3gh 15 วันที่ผ่านมา

      @@tutorialhorizon9085 Wow responding to such an old video and fixing the issue so quickly is rare. You really do deserve more subs.