We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Data Structures
  3. Trees
  4. Swap Nodes [Algo]
  5. Discussions

Swap Nodes [Algo]

  • stefanks + 15 comments

    In python had to change recursion limit to work on the last two test inputs

    import sys sys.setrecursionlimit(15000)

    • carborundum + 2 comments

      I used a loop with a deque as a stack instead to get around that problem

      • magoarcano + 1 comment

        I used a loop with a deque as a queue too but it didn't get around that problem with that solution

        • reddeadya + 0 comments

          You can use even the list() and it works. See the "Iterative InOrder traversal" example: here on wiki

      • martincs14 + 0 comments

        Interesting... can you explain briefly how you used a deque to get around the problem.

    • j_b_shteyn + 0 comments

      Thanks for the tip

    • jellybeanfiend + 1 comment

      Amazing! This is exactly what I hoped to find in the comments. Thanks!

      • shukla1804 + 1 comment

        what prerequisite i need to solve this question

        • shshnk28 + 2 comments

          solve level order traversal first. the logic here is similar.

          1. try to create a tree from the input.
          2. get the height of the tree.
          3. read the next set of input. go to the particular level and swap the nodes.
          • umerfarooq + 1 comment

            i'm confused, we have to swap nodes(means that whole node containing its child nodes are also moved form left to right or right to left) or we have to swap nodes data.

            • vinayb21 + 0 comments

              We have to swap nodes not their data.

          • manthan_learner + 1 comment

            I did the same thing but am getting time out in test cases 6,7,10 and 11. Can any one suggest some thing?

            • coder08122014 + 0 comments

              same here bro, i first created a tree then inserted nodes acoordingly on the basis of input then swapped but it is giving timeout in test case 6,7,10,11. please provide me an update as soon as u get it,and ill do the same

    • bibhash + 0 comments

      Thank you so much! Would never have figured that out.

    • Keerthanss + 0 comments

      Thank you!

    • mulberrylane + 0 comments

      Awesome, I finally got every test past! Thanks.

    • imhktc + 0 comments

      I never knew there was recursion limit, thanks!!

    • GeoMatt22 + 0 comments

      Ha! Good trick.

      It was fun to work out the in-order traversal using a list-based stack though :)

      By the way, a recursion limit of 1200 is sufficient. (1024 is too small for sure.)

    • ayush199429 + 0 comments

      Thanks a lot!!

    • jimmy_valentine + 0 comments

      You saved my life bro. I just started coding in python so didn't know that such a thing exists. I was getting this error for past half an hour!Thanks

    • andrewpan64 + 0 comments

      THANK YOU! I've been trying to memoize the shit out of this problem after passing all of the other test inputs, can't believe all I had to do this whole time was set the recursion limit

    • tmensink + 0 comments

      Thanks! Saved me a lot of time for needless debugging. Code was (in principle) ok.

    • prabhjyot28 + 0 comments

      Thanks buddy! you saved my lot of time.

    • apoulin + 0 comments
      [deleted]
    • mehulgala007 + 0 comments

      Thanks you. This was exactly what I came to look for in the comments section.