C++

Modify the main() function

binary trees assingment

modify the main function

we have a that information.

#include using namespace std; //==== struct Node { int data; Node* left; Node* right; Node (int d, Node* 1 = 0, Node* r = 0) { data = d; left = 1; right = r; } void print (Node *n) { if(!n) return; print (n->left); cout data; print (n->right); } void serial (Node *n) { if (n == 0) { cout data serial(n->left); serial(n->right); cout