node is a class that will create a binary tree node whose children are node pointers left and right. The class variable data is a pointer of the template type that will point to dynamically allocated...

node is a class that will create a binary tree node whose children are node pointers left and right. The class variable data is a pointer of the template type that will point to dynamically allocated memory that holds the actual data. Usually chars, but since it is templated it can hold any type. BinaryTree is made up of a root pointer of node type node has all of the main functionality of the program such as inserting the list in a level order manner to the Binary Tree and performing the traversals (pre-order, post-order, in-order, and level-order). It also has Rule of 3 implementation (Destructor, Copy Constructor, and Assignment Operator) along with other quality of life features.