Here you'll write the inorder traversal function in the header file "bst. h". notice that the public inorder function calls a private recursive function _ inorder to do the actual traversal. this public-private strategy is the correct way to implement recursive functions, where the public function kicks off the recursion and the private function does the actual work. the public function is written for you, your job is to implement the private _ inorder function. he main program has been written to input a sequence of integers and build a binary search tree, which you can then output. the input sequence is followed by a negative sentinel. here's an example program run: 5025881040999-1size: 6inorder: 10 25 40 50 88 999your job is to produce that last line of output, the inorder traversal of the tree with output to cout. main. cpp is a read only file#include #include "bst. h"using namespace std; int main(){binarysearchtree tree; int key; 1. inputs values from the keyboard and builds a binary search tree; // reads input until the sentinel (a negative value) is input. the// resulting binary search tree is returned.//cin > > key; while (key > = 0){tree. insert(key); cin > > key; } 2. output size and contents (in order): //cout < < "size: " < < tree. size() < < endl; tree. inorder(); // done: return 0; }bsh. h is the file to work on./*bsh. h* binary search tree//#pragma once#include using namespace std; templateclass binarysearchtree{private: struct node{tkey key; node* left; node* right; }; node* root; // pointer to root node of tree (nullptr if empty)int size; // # of nodes in the tree (0 if empty) _inorder does the actual inorder traversal and output// to console. each key is output to the console followed// by " ", including the last key.//void _inorder(node* cur){ todo: //}public: default constructor: creates an empty tree.//binarysearchtree(){root = nullptr; size = 0; } size: returns the # of nodes in the tree, 0 if empty.//int size(){return size; } inorder: performs an inorder traversal of the tree, outputting// the keys to the console.//void inorder(){cout < < "inorder: "; _inorder(root); cout < < endl; }};

Ulia is planning to attend the same private four-year college her parents attended. she wants to save at least $18,000 in four years to contribute to her college education. which monthly deposit amounts can julia use to achieve her goal? check all that apply.

Writing a modular program in visual c++. i am new to this and not sure what i am missing. i am getting the following error: baddate.cpp: in function ‘int main()’: baddate.cpp: 50: 3: error: ‘else’ without a previous ‘if’elsehere are the instructions and code: writing a modular program in c++in this lab, you add the input and output statements to a partially completed c++ program. when completed, the user should be able to enter a year, a month, and a day. the program then determines if the date is valid. valid years are those that are greater than 0, valid months include the values 1 through 12, and valid days include the values 1 through 31.notice that variables have been declared for you.write the simulated housekeeping() function that contains the prompts and input statements to retrieve a year, a month, and a day from the user.include the output statements in the simulated endofjob() function. the format of the output is as follows: month/day/year is a valid date.ormonth/day/year is an invalid date.execute the program entering the following date: month = 5, day = 32, year = 2014. record the output of this program.execute the program entering the following date: month = 9, day = 21, year = 2002. record the output of this /* program name: baddate.cppfunction: this program determines if a date entered by the user is valid.input: interactiveoutput: valid date is printed or user is alerted that an invalid date was entered*/#include bool validatedate(int, int, int); using namespace std; int main(){// declare variablesint year; int month; int day; const int min_year = 0, min_month = 1, max_month = 12, min_day = 1, max_day = 31; bool validdate = true; // this is the work of the housekeeping() method// get the year, then the month, then the daycout< < "enter the year"< > year; cout< < "enter the month"< > month; cout< < "enter the day"< > day; // this is the work of the detailloop() method// check to be sure date is validif(year < = min_year) // invalid yearvaliddate = false; else if (month < min_month || month > max_month) // invalid monthvaliddate = false; else if (day < min_day || day > max_day) // invalid dayvaliddate = false; // this is the work of the endofjob() method// test to see if date is valid and output date and whether it is valid or notif(validdate == true); {// output statementcout<

Which of the following is not a source of sustainable raw materials? a) coal mine b) flick of sheep c) cotton plantation d) line forest.