Talk:In-order traversal

While I hesitate to delete an entire page, I think this topic just doesn't deserve a page for itself. For one, I think it's uninstructive to think of an in-order traversal's path through a tree; it's better to think of it in a recursive way. First it visits all nodes in the left subtree in order, then the node, then all in the right subtree in order, and so the result is in order. Thus a simple three-line code example is really enough to convey the idea.

I've added a little bit of explanation to the piece of the binary tree article which discusses this. I emphasise that this is in the binary tree article, since you can perform this traversal on any binary tree, not just a binary search tree.

Derrick Coetzee 14:11, 23 Jan 2004 (UTC)