preorder

#include <iostream>
using namespace std;

// Definition for a binary tree node.
struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

void preorderTraversal(TreeNode* root) {
    if (root == NULL) {
        return;
    }

    // Step 1: Visit the root node
    cout << root->val << " ";

    // Step 2: Recursively traverse the left subtree
    preorderTraversal(root->left);

    // Step 3: Recursively traverse the right subtree
    preorderTraversal(root->right);
}

int main() {
    // Create a sample binary tree
    TreeNode* root = new TreeNode(1);
    root->left = new TreeNode(2);
    root->right = new TreeNode(3);
    root->left->left = new TreeNode(4);
    root->left->right = new TreeNode(5);

    // Step 4: Perform preorder traversal starting from the root
    cout << "Preorder Traversal: ";
    preorderTraversal(root);

    return 0;
}