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-order traversal visits nodes in the following order: left subtree, root, right subtree. This results in nodes being visited in ascending order for a binary search tree.

How do 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);
}

This function recursively visits the left child, prints the root, and then visits the right child.

What about pre-order and post-order traversal?

Pre-order traversal visits nodes in the order: root, left subtree, right subtree. Post-order traversal visits: left subtree, right subtree, root. Would you like code examples for these as well?