urgent simple c++

The C++ code to create the previous tree is given below:

#include

using namespace std;

//declaration for new tree node

struct node {

int data;

struct node *left;

struct node *right;

};

//allocates new node

struct node* newNode(int data) {

// declare and allocate new node

struct node* node = new struct node();

node->data = data; // Assign data to this node

// Initialize left and right children as NULL

node->left = NULL;

node->right = NULL;

return(node);

}

int main()

{

node* root = newNode(0);

root->left = newNode(1);

root->right = newNode(2);

root->left->left = newNode(3);

root->left->right = newNode(4);

root->right->left = newNode(5);

root->right->right = newNode(6);

// The code for print should be here

delete root->right->right;

delete root->right->left;

delete root->left->right;

delete root->left->left;

delete root->right;

delete root->left;

delete root;

}

Question 1: In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A Sample Binary tree is shown below: 0 Left Right Left Right Left Right 6 The C++ code to create the previous tree is given below: #include using namespace std; //declaration for new tree node struct node { int data; struct node *left; struct node *right; }; I/allocates new node struct node* newNode(int data) { // declare and allocate new node struct node* node = new struct nodel); node->data = data: // Assign data to this node // Initialize left and right children as NULL node->left = NULL; node->right = NULL; return(node); } int main() { node* root = newNede(0); root->left = newNode(1); root->right = newNede(2); root->left->left = newNede(3); root->left->right = new Nade14); root->right->left newnede (5); root->right->right = new Nade16); // The code for print should be here delete root->right->right; delete root->right->left; delete root->left->right; delete root->left->left; delete root->right; delete root->left; delete root; } Complete the main code to print the data in the tree to the console as the following figure: 0 1 2 3 4 5 6