How do I implement tree traversal in my code?

How do I implement tree traversal in my code?

Tree traversal can be done using various methods like in-order, pre-order, and post-order. Which one are you interested in?

I'm interested in in-order traversal. Can you show me 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 in Python:

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 if I want to implement it iteratively instead of recursively?

You can use a stack to implement in-order traversal iteratively. Here's an example:

def in_order_traversal_iterative(root):
    stack = []
    current = root
    while stack or current:
        while current:
            stack.append(current)
            current = current.left
        current = stack.pop()
        print(current.val)
        current = current.right