Please read the comments and implement the three traversal functions in treeTraversal.cpp. Then complete the following steps: 1. In the main(), declare a binary tree root in which elements are char type, and call three traversal functions to print the elements of this binary tree. 2. Compile and run the program to make sure that your functions work correctly. 3 3. Add a new function create_binary_tree_int(), in which elements are integers. The binary tree shape is, 2 5 (11) (4) 4. In the main, declare a binary tree root_int which is created by the function create_binary_tree_int(), and call three traversal functions to print the elements of this binary tree. 5. Compile and run the program to make sure that your functions work correctly. The expected result: preorder: A B D - E -> C > inorder: D -> B -> E -> A -> C -> postorder: D -> E > B > C -> A -> preorder: 1 -> 7 -> 2 -> 6 inorder: 2 -> 75 - postorder: 2 -> 5 -> 11 -> 5 <- 6 -> 11 -> 6 -> -> 11 -> 3 -> 1 - -> 3 -> 9 -> 4 -> -> 4 -> 9 -> 7 -> 4 -> 9 -> 3 -> -> 1 -> Write a C++ program to print the elements of binary trees using preorder, inorder, and postorder traversal. The program includes the following: Declare and implement functions preorder, inorder, and postorder in the file treeTraversal.cpp. // treeTraversal.cpp #include using namespace std; template struct BinaryNode { T data; BinaryNode✶ left; BinaryNode* right; BinaryNode(const T & d = T()): data(d), left(nullptr), right(nullptr) { } }; //print the elements of binary tree in preorder template void preorder(BinaryNode* t) { // add your code } //print the elements of binary tree in inorder template void inorder(BinaryNode* t) { // add your code } //print the elements of binary tree in postorder template void postorder (BinaryNode* t) { // add your code } The main function is contained in the file Lab08.cpp // lab08.cpp #include "treeTraversal.cpp" BinaryNode* create_binary_tree() { } BinaryNode* node_A = new BinaryNode('A'); BinaryNode* node_B = new BinaryNode('B'); BinaryNode* node_C = new BinaryNode('C'); BinaryNode* node_D = new BinaryNode('D'); BinaryNode* node_E = new BinaryNode('E'); node_A->left = node_B; node_A->right = node_C; node B->left = node_D; node_B->right = node_Ė; return node_A; BinaryNode* create_binary_tree_int() { } BinaryNode* node1 = new BinaryNode(1); BinaryNode* node = new BinaryNode(7); BinaryNode* node3 = new BinaryNode(3); // Add you code to create remain 6 nodes node1->left = node7; node1->right = node3; // Add you code to connect nodes return node1; int main() { } BinaryNode* root = create_binary_tree(); // add your code // call three traversal functions to print elements BinaryNode* root_int = create_binary_tree_int(); // add your code // call three traversal functions to print elements

this shows me i need the C++ code Your answer could not be processed because it contains errors: line 3: a function-definition is not allowed here before '{' token

1. Write a c++ code that takes two integer numbers as inputs, then adds them using a function called add(x,y), then subtracts them using a function called subtract(x,y), and outputs the results in an understandable way.

Please use easy logic with proper indentations and comments for understanding!. Coding should be in C++. I am providing an algorithm that you will need to answer this coding question. I am also providing this solved program but it's not printing each line separately as it supposed to (Output is given in the picture). The file has 3 separate sentences on 3 lines. Our program supposed to print three separate lines as exactly shown in the sample output. Please review my code and provide a correction to it. Thank you 1 2 3 #include <iostream> 4 #include <fstream>5 #include <cstdlib>6 7 using namespace std; 8 9 void status(string st,int &vowel,int &consonant, int &other)10 {11 12     //if it is vowel13     if ((st[0]=='a' || st[0] == 'e' || st[0] == 'i' || st[0] == 'o' || st[0]=='u') || (st[0]=='A' || st[0] == 'E' || st[0] == 'I' || st[0] == 'O' || st[0]=='U') )14         vowel++;  //incrementing vowels by 115     else if(isalpha(st[0]))16         consonant++;…

Can someone help me to fix my user-defined, value-returning expression? Here's the instructions to my C++ Program: Instructions Write a value-returning function, isVowel, that returns the value true if a given character is a vowel and otherwise returns false. For the input E, your output should look like the following:E is a vowel: 1 When printing the value of a bool, true will be displayed as 1 and false will be displayed as 0. And here's what I have so far: //Declare include-header files#include <iostream> #include <string.h> //Declare namespace statementsusing namespace std; //Define the isVowel userdefined value-returning functionint isVowel(char ch){if ((ch == 'A') || (ch == "E") || (ch == 'I') || (ch == "O") || (ch == "U") || (ch == 'a') || (ch =='e') || (ch == 'i') || (ch == 'o') || (ch == 'u')) {return true;}else{return false;}}} int main() //Define the main function{//Define variableschar character; //Testing the isVowel function.//Prompt the user to input a…