Create a C$++$ program to apply the learnings in different data structures.

A$.$ The program should have a main menu that will prompt the user to enter a choice.

B$.$ If the user enter number $1,$ the program will ask the user to enter the following options to run.

C$.$ If the user enter number $1,$ the program will ask the user to enter a number to be enqueued. Also the program should return to the menu of options of the queue data structure.

D$.$ If the user enter number $2,$ the program will ask the user to enter a number to be dequeued. Also the program should return to the menu of options of the queue data structure.

E$.$ If the user enter number $3,$ the program will display the data elements in the queue. Also the program should return to the menu of options of the queue data structure.

F$.$ If the user enter number $4,$ the program will display the data element$($s$)$ in front of the queue. Also the program should return to the menu of options of the queue data structure.

G$.$ If the user enter number $5,$ the program will display the data element$($s$)$ at the rear of the queue. Also the program should return to the menu of options of the queue data structure.

H$.$ If the user enter number $6,$ the program will exit the options in the queue data structure and return to the main menu of options of data structure

I. At the main menu, if the user enter number $2$ the program will ask the user to

J$.$ If the user enter number $1,$ the program will ask the user to enter an element to be inserted in the binary tree. Also after insertion, the program should return to the menu of options of the binary tree.

K$.$ If the user enter number $2,$ the program will display the inorder traversal of the binary tree. Also after the display, the program should return to the menu of options of the binary tree.

L$.$ If the user enter number $3,$ the program will display the preorder traversal of the binary tree. Also after the display, the program should return to the menu of options of the binary tree.

M$.$ If the user enter number $4,$ the program will display the postorder traversal of the binary tree. Also after the display, the program should return to the menu of options of the binary tree.

N$.$ If the user enter number $5,$ the program will exit the binary tree menu of the user enter number $3$ the program will exit and display a options and return to the main menu of options of the data structure.

O$.$ In the main menu of options, if thank you message.