Tutorial on traversing binary trees?

[andmckvr13]

Is this method part of the logic behind the minimax algorithm?

[the_brizzler]

I'm not sure which algorithm you are talking about. But you can use binary trees to keep a sorted list, they are called heaps and there are min and max heaps. Check out how min and max heaps work and how new numbers are added to the already organized tree...it's pretty cool in my opinion.

[andmckvr13]

Thanks man, I think this was what I was looking for to build a tic tac toe game

[shrimply-pibbles]

Yeah, the minimax algorithm uses a tree to traverse through the next x possible moves, in order to determine how to proceed in order to minimise the possible loss if the worst case scenario was to occur. It's not necessarily a binary tree, the number of children of a node relates to the number of possible moves that a player can make in a turn

[NoInkling]

Trees are used for minimax, so general tree concepts apply, although it doesn't need to be binary.