Data Structures and algorithm

write program in c++

Write a program that will take N values from the user and do the following things. 1. If input value is even value then insert it into Even_BST tree. 2. If input value is odd value then insert it into Odd_BST tree. 3. In both tree (Even_BST, Odd_BST), if the values are divisible by 9 then do the following If the value is even then delete it from Even_BST (i.e. 18, 36, 54 even values which are divisible by 9) If the value is odd then delete it from Odd_BST (i.e. 27, 45, 63 odd values which are divisible by 9) 4. The display function should display the following. Total number of nodes in Even_BST tree and their sum. Total number of nodes in Odd_BST tree and their sum. Display values in inorder format