Create a program that implements the following tree data structures: - BST(Binary Search Tree) - AVL - Red Black Tree along with the mandatory methods of insert, delete and print. the program receives a stream of input from the user (i.e. 23 66 73 88 19) and then provides the user option which tree to construct along with options of the methods.