Create a binary tree data structure used to keep track of data (e.g. an int). Explore Pre-, Post-, and In- Order traversal as well as breadth-first search.

Grading Criteria

Implementation o [3 Points] Binary Tree (Doesnt have to be sorted) data structure o [5 Points] Pre-Order Traversal o [5 Points] Post-Order Traversal o [5 Points] In-Order Traversal o [5 Points] Breadth-First Search

Demonstration o Three different trees to traverse (containing at least 10 items each)

[1 Point] A left-unbalanced tree to traverse

[1 Point] A right-unbalanced tree to traverse

[1 Point] A symmetrical tree to traverse

o On each of the three different trees to traverse, demonstrate:

[1 Point] Pre-Order Traversal [1 Point] Post-Order Traversal [1 Point] In-Order Traversal

[1 Point] Breadth-First Search

Please use C++, and must meet all of the grading criteria