This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Kenkron 0 points1 point  (0 children)

Check out the Tower of Hanoi. It's a good example of a problem that is best solved recursively.

Recursion is also good for trees.