How can I implement tree traversal in Python?

How can I implement tree traversal in Python?

You can implement tree traversal in Python using different methods like in-order, pre-order, and post-order. Which one would you like to know about?

Can you explain in-order traversal?

Sure! In-order traversal visits the left subtree, the root node, and then the right subtree. Here's a simple implementation:

Please show me the code for in-order traversal.

Here's a basic 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()