You're trapped in a maze. There is a way out. Path junctions are all 3-way.
If you use the strategy of always taking the path going right, what will happen?
(Note: This problem is deliberarely vague.)
(In reply to
re(2): this is the real picture of the tree by qball)
> trees CAN be connected and circular though
> you could make a maze and turn it into a tree if you knew how
My definition of a tree is a connected graph where there is exactly one unidirectional path between two nodes. So no cycles unless you backtrack.
re(3): this is the real picture of the tree
