Please help me create this program in C++.

I. Write a program to implement a binary tree from a sequence of data. Once the tree is constructed, implement search and tree traversal functions including breadth-first traversal and depth-first traversal (preorder, inorder, and postorder). Search and tree traversal functions are applied to the most recently constructed tree. Here is a set of requirements to follow: Type the homework number and your full name at the top in your source code. /* Homework #4, James Bond */ Your program should be a menu-driven and execute the chosen command. If you type 6, then . exit the program. MEN Create (0), Search (1), Breadth-First Traversal (2) Depth-First Traversal: preorder (3), inorder (4),postorder (5) Exit Program (6) Choose? Display a message, in case when searching a node that does not exist in the tree