How do I traverse a binary search tree in C++?

How do I traverse a binary search tree in C++?

You can traverse a binary search tree using three main methods: in-order, pre-order, and post-order traversal. Which one would you like to know more about?

Can you explain in-order traversal?

In in-order traversal, you visit the left subtree first, then the root node, and finally the right subtree. This results in the nodes being visited in ascending order.

How would I implement in-order traversal in C++?

Here's a simple implementation:

void inOrderTraversal(Node* root) {
    if (root == nullptr) return;
    inOrderTraversal(root->left);
    std::cout << root->data << " ";
    inOrderTraversal(root->right);
}

What about pre-order and post-order traversal?

In pre-order traversal, you visit the root first, then the left subtree, and finally the right subtree. In post-order, you visit the left subtree, then the right subtree, and finally the root. Would you like code examples for these as well?