Home/ Questions/Q 7751867
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-01T11:39:29+00:00

For dynamic programming, what are some of the ways that I store a tree

  • 0

For dynamic programming, what are some of the ways that I store a tree with?

I am working on an assignment that requires me to solve a maze with no left turn and a minimize right turn. The idea that I had is to store all possible paths into a tree and then going through (traverse) the tree looking for the minimum right-turns. To make the code more efficient, anytime a path involves either

a) a left turn
b) a solution with more right turn than the current best known solution

I will not add it to the tree. Hopefully I have a clear understanding of what I am doing here. I really do appreciate input on this.

The tree that I am looking at storing will contain all possible directions in the maze, and the parent of each children will be the previous location. I believe that some parents will have more than 2 children.

I am wondering what is the best way to store this kind of tree?

Thank you in advance.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    If the problem is to solve the maze, I suggest using backtracking instead of creating such a tree. If you have to create the tree, you could use a tree in which every junction where you could turn right is represented as a node, and the children would be the next junction if turned right, or the next one if you did not. I’m not sure I understood you correctly, but I hope this gives you some pointers as to how to continue.

    • 0