DFS & BFS in binary tree

Write a C or C++ program that performs a >Depth First Search (DFS) in a binary tree. The program should allow the >user to >enter as many integers as they wish (unlimited). The program then form a >binary tree each time the user enters the number. >Once the user type in a negative number, the tree >stops growing. The program then allow the user to type in a number to look >for >within the tree. The program then reports the path it has traversed until >it gets to the specified number. >Also, add the Breadth First Search (BFS) into the >program and provding and option for user to choose the searching techniques >(BFS or DFS) >=== ## Deliverables I need to submit this homework by Wednesday. I have been trying for a week and I can't get it done. I have it partly made and wouldn send it to the coder who takes the bid. ## Platform Windows