How do I perform tree traversal in Python?

How do I perform tree traversal in Python?

In Python, you can perform tree traversal using various methods like in-order, pre-order, and post-order traversal. Do you have a specific type in mind?

Can you explain in-order traversal with an example?

Sure! In in-order traversal, you visit the left subtree, then the node, and finally the right subtree. Here's a simple example:

class Node:
    def __init__(self, key):
        self.left = None
        self.right = None
        self.val = key

    def in_order_traversal(self):
        if self.left:
            self.left.in_order_traversal()
        print(self.val)
        if self.right:
            self.right.in_order_traversal()

What output would I get from this example?

If you create a tree and call the in_order_traversal method, it will print the values of the nodes in ascending order. For example, if your tree has values 1, 2, and 3, the output will be:

1
2
3