a. Write a program to illustrates how to use the Binary Tree concept in a program. Use the library binarySearchTree.h and binaryTree.h to run the program. Use the print node function below. //Print...

c++ programming

Extracted text: a. Write a program to illustrates how to use the Binary Tree concept in a program. Use the library binarySearchTree.h and binaryTree.h to run the program. Use the print node function below. //Print node function void print (int& x) { cout < x="">< "="" ";="" ww="" follow="" the="" instruction="" below="" and="" answer="" the="" question="" given.="" -="" include="" the="" binarvsearch="" tree.h="" library="" -="" declare="" the="" print="" function="" use="" to="" print="" the="" node="" -="" create="" main="" function="" and="" include="" your="" information="" details="" -="" write="" down="" your="" info="" -="" declare="" treeroot="" to="" be="" a="" binary="" search="" tree="" object="" -="" declare="" variables="" num="" as="" an="" integer="" variables.="" se="" -="" print="" out="" an="" instruction="" for="" user="" to="" inputa="" numbers="" ending="" with="" -999="" -="" get="" a="" numbers="" from="" user="" input="" -="" use="" a="" while="" loop="" to="" insert="" the="" numbers="" into="" treeroot="" ending="" with="" -999="" -="" use="" the="" member="" function="" treeheight="" of="" treeroot="" to="" measure="" the="" tree="" height="" of="" treeroot="" -="" use="" the="" member="" function="" inordertraversal="" of="" treeroot="" to="" traverse="" the="" binary="" search="" tree="" treeroot="" and="" print="" the="" inorder="" traversal.="" www="" b.="" expand="" the="" program="" above="" to="" illustrates="" preorder="" and="" postorder="" traversal="" in="" a="" program.="" ww="" w="">