How do I perform binary tree traversal in C++?

How do I perform binary tree traversal in C++?

In C++, you can perform binary tree traversal using three main methods: inorder, preorder, and postorder. Would you like to see examples of each?

Yes, please show me the inorder traversal example.

Sure! Here's a simple example of inorder traversal in C++:

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

This function visits the left subtree, then the root, and finally the right subtree.

What about preorder traversal?

For preorder traversal, you can use the following code:

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

This visits the root first, then the left subtree, and finally the right subtree.

Can you explain postorder traversal as well?

Absolutely! Here's how you can implement postorder traversal:

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

This method visits the left subtree, then the right subtree, and finally the root.