How do different tree traversal methods compare?

What are the different methods for traversing a tree?

The main methods for tree traversal are in-order, pre-order, post-order, and level-order. Each has its use cases.

Can you explain how in-order traversal works?

In in-order traversal, you visit the left subtree, then the node, and finally the right subtree. This results in sorted order for binary search trees.

What about pre-order and post-order? How do they differ?

In pre-order, you visit the node first, then the left and right subtrees. In post-order, you visit the left and right subtrees before the node. They are useful for different applications.

When would I use level-order traversal?

Level-order traversal is used when you need to process nodes level by level, such as in breadth-first search algorithms.