\#include bits/stdc++.h> using namespace std; class Node \{ public: int data; Node * left; Node *right; Node (int d) \{ data =d; left = NULL; right = NULL; \} \}; class Solution \{ public: Node* insert (Node* root, int data) \{ if (root == NULL ){ return new Node(data); \} else \{ Node* cur; if (data data ){ cur = insert (root->left, data); root left = cur; \} else \{ cur = insert(root->right, data); root > right = cur; \} return root; \} \} class Node \{ public: int data; Node left; Node right; Node (int d) \{ data =d; left = NULL; right = NULL; \} \}; / void preorder (Node *root) \{ \} \}; //End of Solution int main() \{ Solution myTree; Node root = NULL; int t; int data; std: : cin t; while (t>){ std: : cin data; root = myTree. insert (root, data); \} myTree.preorder (root); return 0; \} Complete the pr2O Order function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preorder function. Constraints 1 Nodes in the tree 500 Output Format Print the tree's preorder traversal as a single line of space-separated values. Sample Input Sample Output 125346 Explanation The preorder traversal of the binary tree is printed