How can I implement tree traversal in different programming languages?

How can I implement tree traversal in different programming languages?

Tree traversal can be implemented in various ways, such as in-order, pre-order, and post-order. Which language are you interested in?

Can you show me an example in Python?

Sure! Here's a simple in-order traversal 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 about in Java?

In Java, it looks like this:

class Node {
    int data;
    Node left, right;

    Node(int item) {
        data = item;
        left = right = null;
    }

    void inOrder() {
        if (left != null) {
            left.inOrder();
        }
        System.out.print(data + " ");
        if (right != null) {
            right.inOrder();
        }
    }
}

Can you provide an example in JavaScript as well?

Absolutely! Here's how you can do it in JavaScript:

class Node {
    constructor(data) {
        this.data = data;
        this.left = this.right = null;
    }

    inOrder() {
        if (this.left) this.left.inOrder();
        console.log(this.data);
        if (this.right) this.right.inOrder();
    }
}