C++ project

Machine Problem 6 - Binary Trees

Write a C++ program to do the following:

Inputs a line of text.

Tokenizes the line into separate words.

Inserts the words into a binary search tree (BST).

Do a postorder traversal of the tree and print it.

Do a preorder traversal of the tree and print it.

Do an inorder traversal of the tree and print it.

Print the heights and the number of leafs in each of the three binary search trees.

Please upload the following:

The class .cpp file

The main program

The class .h file

Output File