Binary Search Tree determination

Write a program that takes a post order plus sequence from an input file, and determines whether or not the tree is a binary tree or not. If it is not a binary tree, then output an error message and exit. If the sequence is binary tree, construct the Binary tree and compute for each level of the tree, the number of nodes at that level. Find depth of tree, and find a node whose depth is equal to the depth of the tree(report the rightmost node if more than one node occurs). Find the frequency of the root value of the tree. If root value is not repeated, test to see if the binary tree is a search tree. Cannot use Standard template library, must write own data structures(classes/structs/stacks/queues,etc...). Must use pointers in code. comments by code in difficult sections. See zip file for complete details. ## Deliverables Simple algorithm. Complete source code of all .cpp and .h files. ## Platform Needs to compile and run correctly on Microsoft Visual Studio's C++ 6.0. ## Deadline information complete project must be complete by july 15th