Hello, sorry to be posting this here, think this is where it would go, I'm still pretty much a rookie with java and I'm trying to create a WumpusHunter sort of character Class. It needs to have a stack based startAt(MountainNode root) method that can navigate a binary tree, I'm really just confused, I can't think of how to implement this without recursion. I'm sorry to turn to you but I'm just looking for any ideas on how to start the algorithm.

Thanks in advance at least for the reading.

-Jen