C$++$ Objective: Implement a Binary tree.

Instructions:

Given the root of a binary tree, return the inorder traversal of its nodes' values.

Given the root of a binary tree, return the preorder traversal of its nodes' values.

Given the root of a binary tree, return the postorder traversal of its nodes' values.

Given the root of a binary tree, invert the tree, and return its root.

Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

What to Submit:

You need to demo your code and your final submission $($zip file$)$ will need to have the following files:

main.cpp

Screen captures of your output