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 funcs. cpp
// funcs. cpp
#include< iostream>
using namespace std;
template
struct BinaryNode
T element;
BinaryNode left;
BinaryNode right;
BinaryNode(const T & d T()) : element(d)
left nullptr;
right nullptr;
//print the elements of binary tree in preorder
template
void preorder (const BinaryNode* root) //
add your code //
print the elements of binary tree in inorden
template
void inorder(const BinaryNode root) //
add your code //
print the elements of binary tree in postorder
void postorder(const BinaryNode root) // add your code ename T> .
The main function is contained in the file lab06. cpp
// lab06.cpp
#include "funcs. cpp..
BinaryNode BinaryNodeくchar>* BinaryNode(char>*
BinaryNode* BinaryNode BinaryNode< char>*
node-A node-B
node_C
node-D
node-E new BinaryNode(char»('A');
new BinaryNode«char»('B');
new BinaryNode('C');
new BinaryNode«char»('D');
new BinaryNode('E' ); = = =
node. A->left = node-B; node A->right =
node C; node-B->left = node. D;
node_B->right node_E; return
node A;
int main() BinaryNode* root create-binary-tree(); = //
add your code //
call traversal functions to print elements