Create a template Binary Tree Node class (class BinNode) which has private attributes for a payload (element) and two child pointers. Create a constructor, accessors/mutators for the payload and pointers, a destructor, and an overload for theostreaminsertion (<<) operator.

Create a template Binary Tree class (class BTree) which has private attributes for the head pointer and print traversal order. Create constructor(s), a copy constructor, accessor/mutator for the head pointer and print traversal order, an overload for the assignment (=) operator, and a destructor. In addition, overload the ostream insertion (<<) operator allowing for output in breadth order, pre-order, in-order, or post-order, depending how the print order attribute is set.

Write a C main() program to create the following Binary Tree:

and output the nodes using the overloaded << operator in all four traversals (breadth order, pre order, in order, post order). Finally, demonstrate that the = overload and the copy constructor work correctly.