The document contains C++ code for creating and traversing a complete binary tree. It includes functions for creating nodes, inserting nodes in level order, and performing inorder traversal, while placeholders are provided for additional tasks such as preorder traversal and counting leaf nodes. It also reads a binary tree's structure from a file and transforms it from an array-based representation to a linked list-based representation.

1. #include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <string>
using namespace std;
/* A binary tree node has data,pointer to left child and apointer to right child */
struct Node
{
int data;
Node* left, * right;
};
/*Function for creating a new Node structure */
Node* newNode(int data)
{
Node* node = new Node;
//Node* node = (Node*)malloc(sizeof(Node)); //will also work.
node->data = data;
node->left = node->right = NULL;
return (node);
}
// Function to insert nodes in level order. This function takes an array-based treerepresentation as
inputand
// convert it into a linked list-based tree representationNode* insertLevelOrder(vector<int>
tree_vec,
//tree_vec: array implementation,
create node for position i.
int i, int n)
{
Node* root = nullptr;
// Base case for recursion
if (i < n)
{
root = newNode(tree_vec[i]);
// insert left child
root->left = insertLevelOrder(tree_vec,
2 * i + 1, n);
// insert right child
root->right = insertLevelOrder(tree_vec,
2 * i + 2, n);
}
return root;

2. }
// Example code for InOrder traversal
void inOrder(Node * root)
{
if (root != NULL)
{
inOrder(root->left);
cout << root->data << " ";
inOrder(root->right);
}
}
int main()
{
vector<int> tree_vec;
string file_name;
int temp_data;
cout << "Please input the file name of a complete binary tree:";
cin >> file_name;
ifstream tree_file(file_name, ios::in);
if (tree_file.fail())
{
cout << "Fail to open the tree file.";
return 0;
}
while (!tree_file.fail() && !tree_file.eof())
{
tree_file >> temp_data;
tree_vec.push_back(temp_data);
}
/*Transform the array-based tree into linked-list in level-order.*/
Node* root = insertLevelOrder(tree_vec, 0, tree_vec.size());
/*Task 1, to be implemented*/
cout << "The Preorder Traversal result is: " << endl;
/*Example implementation*/
cout << "The Inorder Traversal result is: " << endl;
inOrder(root);
/*Task 2, to be implemented*/
cout << "The Postorder Traversal result is: " << endl;
/*Task 3, to be implemented*/
cout << "The number of leaf nodes is: " << endl;
return 0;
}

3. please help me to finish the code with the task using c++

4. #include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <string>
using namespace std;
/* A binary tree node has data,pointer to left child and apointer to right child */
struct Node
{
int data;
Node* left, * right;
};
/*Function for creating a new Node structure */
Node* newNode(int data)
{
Node* node = new Node;
//Node* node = (Node*)malloc(sizeof(Node)); //will also work.
node->data = data;
node->left = node->right = NULL;
return (node);
}
// Function to insert nodes in level order. This function takes an array-based treerepresentation as
inputand
// convert it into a linked list-based tree representationNode* insertLevelOrder(vector<int>
tree_vec,
//tree_vec: array implementation,
create node for position i.
int i, int n)
{
Node* root = nullptr;
// Base case for recursion
if (i < n)
{
root = newNode(tree_vec[i]);
// insert left child
root->left = insertLevelOrder(tree_vec,
2 * i + 1, n);
// insert right child
root->right = insertLevelOrder(tree_vec,
2 * i + 2, n);
}
return root;

5. }
// Example code for InOrder traversal
void inOrder(Node * root)
{
if (root != NULL)
{
inOrder(root->left);
cout << root->data << " ";
inOrder(root->right);
}
}
int main()
{
vector<int> tree_vec;
string file_name;
int temp_data;
cout << "Please input the file name of a complete binary tree:";
cin >> file_name;
ifstream tree_file(file_name, ios::in);
if (tree_file.fail())
{
cout << "Fail to open the tree file.";
return 0;
}
while (!tree_file.fail() && !tree_file.eof())
{
tree_file >> temp_data;
tree_vec.push_back(temp_data);
}
/*Transform the array-based tree into linked-list in level-order.*/
Node* root = insertLevelOrder(tree_vec, 0, tree_vec.size());
/*Task 1, to be implemented*/
cout << "The Preorder Traversal result is: " << endl;
/*Example implementation*/
cout << "The Inorder Traversal result is: " << endl;
inOrder(root);
/*Task 2, to be implemented*/
cout << "The Postorder Traversal result is: " << endl;
/*Task 3, to be implemented*/
cout << "The number of leaf nodes is: " << endl;
return 0;
}